Pilot signals for synchronization and/or channel estimation

ABSTRACT

Disclosed is a method of generating pilot sequences having double lengths of slots used for frame synchronization in an up or down link of a next generation mobile communication system which adopts W-CDMA mode. Disclosed is a method of generating pilot sequences having double lengths of slots used for frame synchronization and defined by 4l+2(l=1,2,3, . . . ) while providing a mathematical method of generating code sequences of slot length. The method of generating pilot sequences having double lengths of slots used for frame synchronization includes the steps of selecting a bit length of pilot sequences used for frame synchronization, selecting a first code sequence indicative of a maximum correlation value at a specific delay point of a correlation period and indicative of a minimum correlation value at the other delay points excluding the specific delay point, selecting a second code sequence indicative of the same correlation characteristic as the selected code sequence, and combining the selected code sequences to generate pilot sequences having the selected bit length.

This application claims the benefit of U.S. Provisional Application No. 60/136,763 filed May 28, 1999 and this application is also a continuation-in-part of application Ser. Nos. 09/373,703 and 09/376,373 filed Aug. 13, 1999 and Aug. 18, 1999, respectively, and application Ser. Nos. 09/525,446, 09/525,448, and 09/525,447, all filed Mar. 14, 2000, whose entire disclosure is incorporated herein by reference therein.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to communication systems, and more particularly, wireless communication systems, preferably, wide band code division multiple access (W-CDMA) communication systems.

2. Background of the Related Art

The use of code division multiple access (CDMA) modulation techniques is one of several techniques for facilitating communications in which a large number of systems are present. FIG. 1 generally illustrates a system 10, which uses CDMA modulation techniques in communication between user equipment (UE) 12 a and 12 b, each UE including a cellular telephone, and base stations (BTS) 14 a and 14 b. A base station controller (BSC) 16 typically includes an interface and processing circuitry for providing system control to the BTS 14 a, 14 b. The BSC 16 controls the routing of telephone calls BTS for transmission to the appropriate UE. The BSC 16 also controls the routing of calls from the UEs, via at least one BTS to the PSTN. The BSC 16 may direct calls between UEs via the appropriate BTS since UEs do not typically communicate directly with one another. The BSC 16 may be coupled to the BTS 14 a and 14 b by various means including dedicated telephone lines, optical fiber links or by microwave communication links.

The arrows 13 a-13 d define the possible communication links between the BTS 14 a and UEs 12 a and 12 b. The arrows 15 a-15 d define the possible communication links between the BTS 14 ba and UEs 12 a and 12 b. In the reverse channel or uplink (i.e., from UE to BTS), the UE signals is received by BTS 14 a and/or BTS 14 b, which, after demodulation and combining, pass the signal forward to the combining point, typically to the BSC 16. In the forward channel or downlink (i.e., from BTS to UE), the BTS signals are received by UE 12 a and/or UE 12 b. The above system is described in U.S. Pat. Nos. 5,101,501; 5,103,459; 5,109,390; and 5,416,797, whose entire disclosure is hereby incorporated by reference therein.

A radio channel is a generally hostile medium in nature. It is rather difficult to predict its behavior. Traditionally, the radio channels are modeled in a statistical way using real propagation measurement data. In general, the signal fading in a radio environment can be decomposed into a large-scale path loss component together with a medium-scale slow varying component having a log-normal distribution, and a small-scale fast varying component with a Rician or Rayleigh distribution, depending on the presence or absence of the line-of-sight (LOS) situation between the transmitter and the receiver.

FIG. 2 illustrates these three different propagation phenomena. An extreme variation in the transmission path between the transmitter and receiver can be found, ranging from direct LOS to severely obstructed paths due to buildings, mountains, or foliage. The phenomenon of decreasing received power with distance due to reflection, diffraction around structures, and refraction is known as path loss.

As shown, the transmitted signal is reflected by many obstacles between a transmitter and a receiver, thus creating a multipath channel. Due to the interference among many multipaths with different time delays, the received signal suffers from frequency selective multipath fading. For example, when the 2 GHz carrier frequency band is used and a car having a UE is travelling at a speed of 100 km/h, the maximum Doppler frequency of fading is 185 Hz. While coherent detection can be used to increase link capacity, under such fast fading, the channel estimation for coherent detection is generally very difficult to achieve. Because of fading channels, it is hard to obtain a phase reference for the coherent detection of data modulated signal. Therefore, it is beneficial to have a separate pilot channel.

Typically, a channel estimate for coherent detection is obtained from a common pilot channel. However, a common pilot channel transmitted with an omnidirectional antenna experiences a different radio channel than a traffic channel signal transmitted through a narrow beam. It has been noticed that common control channels are often problematic in the downlink when adaptive antennas are used. The problem can be circumvented by user dedicated pilot symbols, which are used as a reference signal for the channel estimation. The dedicated pilot symbols can either be time or code multiplexed.

FIG. 3 depicts a block diagram of a transmitter and a receiver for time multiplexed pilot symbols for an improved channel estimation method that works satisfactorily under slow-to-fast fading environments. Known pilot symbols are periodically multiplexed with the sequence of the transmitted data. The pilot symbols and data symbols following pilot symbols constitute a slot, as shown in FIG. 3.

Further, in a DS-CDMA transmitter, the information signal is modulated by a spreading code, and in the receiver, it is correlated with a replica of the same code. Thus, low cross-correlation between the desired and interfering users is important to suppress the multiple access interference. Good autocorrelation properties are required for reliable initial synchronization, since large sidelobes of the autocorrelation function may lead to erroneous code synchronization decisions. Furthermore, good autocorrelation properties are important to reliably separate the multipath components.

Since the autocorrelation function of a spreading code should resemble, as much as possible, the autocorrelation function of white Gaussian noise, the DS code sequences are also called pseudo-noise (PN) sequences. The autocorrelation and cross- correlation functions are connected in such a way that it is not possible to achieve good autocorrelation and cross-correlation values simultaneously. This can be intuitively explained by noting that having good autocorrelation properties is also an indication of good randomness of a sequence. Random codes exhibit worse cross-correlation properties than deterministic codes.

Such mobile communication system has gone through different stages of evolution, and various countries used different standards. First generation mobile systems in the 1980s used analog transmission for speech services. Advanced Mobile Phone Service (AMPS) in the United States, Total Access Communication System (TACS) in the United Kingdom, Nordic Mobile Telephones (NMT) in Scandinavia, Nippon Telephone and Telegraph (NTT) in Japan, etc., belonged to the first generation.

Second generation systems using digital transmission were introduced in the late 1980s. They offer higher spectrum efficiency, better data services, and more advanced roaming than the first generation systems. Global System for Mobile Communications (GSM) in Europe, Personal Digital Cellular (PDC) in Japan, and IS-95 in the United States belonged to the second generation.

Recently, third generation mobile radio networks have been under intense research and discussion and will emerge around the year 2000. In the International Telecommunication Union (ITU), the third generation networks are called International Mobile Telecommunications—2000 (IMT-2000) and in Europe, Universal Mobile Telecommunication System (UMTS). IMT-2000 will provide a multitude of services, including multimedia and high bit rate packet data.

Wideband CDMA has emerged as the mainstream air interface solution for the third generation networks. Wideband CDMA systems are currently being standardized by the European Telecommunications Standards Institute (ETSI) of Europe, the Association for Radio Industry and Business (ARIB) of Japan, the TIA Engineering Committees TR45 and TR46 and the T1 committee T1P1 of the United States, and the Telecommunication Technology Association TTA I and TTA II (renamed Global CDMA I and II, respectively) in Korea. The above description and a background of various systems can be found in WIDEBAND CDMA FOR THIRD GENERATION MOBILE COMMUNICATIONS by T. Ojanpera et al, published 1998, by Artech House Publishers, whose entire disclosure is hereby incorporated by reference therein.

Recently, ARIB in Japan, ETSI in Europe, T1 in U.S.A., and TTA in Korea have mapped out a third generation mobile communication system based on a core network and radio access technique of an existing global system for mobile communications (GSM) to provide various services including multimedia, such as audio, video and data. They have agreed to a partnership study for the presentation of a technical specification on the evolved next generation mobile communication system and named a project for the partnership study as a third generation partnership project (3GPP).

The 3GPP is classified into three part technical studies. The first part is a 3GPP system structure and service capability based on the 3GPP specification. The second part is a study of a universal terrestrial radio access network (UTRAN), which is a radio access network (RAN) applying wideband CDMA technique based on a frequency division duplex (FDD) mode, and a TD-CDMA technique based on a time division duplex (TDD) mode. The third part is a study of a core network evolved from a second generation GSM, which has third generation networking capabilities, such as mobility management and global roaming.

Among the technical studies of the 3GPP, the UTRAN study defines and specifies the transport and physical channels. This technical specification, TS S1.11 v1.1.0, was distributed on March of 1999, whose entire disclosure is hereby incorporated by reference therein. The physical channel includes the dedicated physical channels (DPCHs) used in the uplink and downlink. Each DPCH is generally provided with three layers, e.g., superframes, radio frames and timeslots. As specified in the 3GPP radio access network (RAN) standard, a superframe has a maximum frame unit of 720 ms period. In view of the system frame numbers, one superframe is composed of seventy-two radio frames. Each radio frame has a period of 10 ms, and a radio frame includes sixteen timeslots, each of which includes fields with corresponding information bits based on the DPCH.

FIG. 4 illustrates a frame structure of an uplink DPCH based on the 3GPP RAN standard. The uplink DPCH is provided with two types of channels, e.g., a dedicated physical data channel (DPDCH) and a dedicated physical control channel (DPCCH). The uplink DPDCH is adapted to transport the dedicated data and the uplink DPCCH is adapted to transport the control information.

The uplink DPCCH for the transport of the control information includes various fields such as a pilot field 21 of N_(pilot) bits, a transmit power-control (TPC) field 22 of N_(TPC) bits, a feedback information (FBI) field 23 of N_(FBI) bits and an optional transport-combination indicator (TFCI) field 24 of N_(TFCI) bits. The pilot field 21 includes pilot bits N_(pilot) for supporting channel estimation for coherent detection. The TFCI field 4 supports the simultaneous provision of a plurality of services by the system. The absence of the TFCI field 4 in the uplink DPCCH signifies that the associated service is a fixed rate service. The parameter k determines the number of bits per uplink DPDCH/DPCCH slot. It is related to the spreading factor SF of the physical channel as SF=256/2^(k). The spreading factor SF may thus range from 256 down to 4.

FIG. 5 is a table showing various information of the uplink DPCCH, wherein channel bit and symbol rates are those just prior to spreading. (At the time of this technical specification, the exact number of bits of the different uplink DPCCH fields of FIG. 4 (N_(pilot), N_(TPC), N_(FBI), and N_(TFCI)) was not determined.)

FIG. 6 is a table illustrating pilot bit patterns of the uplink DPCCH, and more particularly, 6-bit and 8-bit pilot bit patterns for each slot. In FIG. 6, the non-shaded sequence is used for channel estimation, and shaded sequence can be used as frame synchronization words or sequences. The pilot bits other than frame synchronization word, e.g., channel estimation word, have a value of 1.

For example, in the case where each slot includes six pilot bits N_(pilot)=6, the sequences formed by slot #1 to slot #16 at bit #1, at bit #2, at bit #4, and at bit #5 are used as the frame synchronization words. In the case where each slot is composed of eight pilot bits (N_(pilot)=8), the sequences at bit #1, at bit #3, at bit #5, and at bit #7 are used as the frame synchronization words. In the case where the pilot bits of each sequences slot are either 6 or 8 in number, a total of four is used as the frame synchronization word. As a result, because one radio frame is provided with sixteen timeslots, the number of pilot bits used as the frame synchronization word is 64 bits per frame.

FIG. 7 shows a spreading/scrambling arrangement for the uplink DPCH based on the 3GPP RAN standard. The arrangement of FIG. 7 is provided for the execution of a quadrature phase shift keying (QPSK) operation where the uplink DPDCH and DPCCH are mapped into I and Q channel branches, respectively.

The spreading is an operation for switching all symbols through the respective channel branches to a plurality of chips. The I and Q channel branches are spread respectively at chip rates based on two different orthogonal variable spreading factors (OVSFs), or channelizing codes C_(D) and C_(C). The OVSF represents the number of chips per symbol on each channel branch. The spread of two channel branches are summed and then complex-scrambled by a specific complex scrambling code C_(scramb). The complex-scrambled result is separated into real and imaginary and then transmitted after being placed on respective carriers.

FIG. 8 illustrates a frame structure of a downlink DPCH based on the 3GPP RAN standard. The number of pilot bits (or symbols) in the uplink DPCH is 6 or 8 because the uplink DPCH is activated at a fixed rate of 16 Kbps. However, since the downlink DPCH is activated at a variable rate, it has pilot symbol patterns illustrated in FIG. 9.

With reference to FIG. 8, similar to the uplink DPCH, the downlink DPCH is provided with two types of channels, e.g., a dedicated physical data channel (DPDCH) and a dedicated physical control channel (DPCCH). In the downlink DPCH, the downlink DPDCH is adapted to transport the dedicated data and the downlink DPCCH is adapted to transport the control information. The downlink DPCCH for transporting the control information is composed of various fields such as a pilot field 27, TPC field 26 and TFCI field 25. The pilot field 27 includes pilot symbols for supporting the channel estimation for coherent detection.

FIG. 9 is a table illustrating pilot symbol patterns contained in the downlink DPCCH, which are classified according to different symbol rates of the downlink DPCCH. For example, in the case where the symbol rate is 16, 32, 64 or 128 Kbps, each slot includes four pilot symbols for an I channel branch and four pilot symbols for a Q channel branch, totaling eight pilot symbols.

In FIG. 9, the non-shaded sequence is used for channel estimation and shaded sequences can be used as frame synchronization words. The remaining pilot symbols other than the frame synchronization word (e.g., channel estimation) have a value of 11. For example, in the case where the symbol rate is 16, 32, 64 or 128 Kbps, the sequences, formed by pilot symbols from slot #1 to slot #16, at symbol #1 and at symbol #3 are used as the frame synchronization words. Accordingly, because the number of pilot symbols used as the frame synchronization words is 4 per slot, 64 pilot symbols are used in each radio frame.

FIG. 10 illustrates a spreading/scrambling arrangement for the downlink DPCH based on the 3GPP RAN standard. The arrangement of FIG. 10 is provided for the spreading and scrambling of the downlink DPCH and a common control physical channel (CCPCH). A QPSK operation is performed with respect to a pair of symbols of the two channels in such a manner that they are serial-to-parallel converted and then mapped into I and Q channel branches, respectively.

The I and Q channel branches are spread respectively at chip rates based on two equal channelizing codes C_(ch). The spread of the two channel branches are summed and then complex-scrambled by a specific complex scrambling code C_(scramb). The complex-scrambled result is separated into real and imaginary and then transmitted, after being placed on respective carriers. Noticeably, the same scrambling code is used for all physical channels in one cell, whereas different channelizing codes are used for different physical channels. Data and various control information are transported to a receiver through the uplink and downlink DPCHs subjected to the above-mentioned spreading and scrambling.

The TS S1.11 v1.1.0 specification also specified a primary common control physical channel (PCCPCH), which is a fixed rate downlink physical channel used to carry the broadcast channel (BCH), and a secondary common control physical channel (SCCPCH) used to carry the forward access channel (FACH) and the paging channel (PCH) at a constant rate. FIGS. 11A and 11B illustrate the frame structure of PCCPCH and SCCPCH, each having a pilot field. The TS S1.11 v1.1.0 specification recommended the pilot patterns for the PCCPCH and SCCPCH. Further, the TS S1.11 v1.1.0 specification recommended the pilot pattern of the DPCH channel for the diversity antenna using open loop antenna diversity based on space time block coding based transmit diversity (STTD) and diversity antenna pilot patterns for PCCPCH and SCCPCH. Those patterns can be found in the TS S1.11 v1.1.0 specification, and detailed description is being omitted.

For frame synchronization, an autocorrelation function must be performed on the basis of the pilot pattern sequence. In the pilot sequence design, finding an autocorrelation of a sequence with the lowest out-of-phase coefficient is important to decrease the probability of false alarm regarding the synchronization. A false alarm is determined when a peak is detected when there should not be a peak detection.

Optimally, the result of the autocorrelation for a frame with a sequence at a prescribed pilot bit should have same maximum values at zero and middle time shifts of one correlation period, which are different in polarity, and the remaining sidelobes at time shifts other than zero and middle should have a value of zero. However, the various pilot patterns recommended in the TS S1.11 v1.1.0 do not meet this requirement, both in the uplink and downlink.

In an article entitled “Synchronization Sequence Design with Double Thresholds for Digital Cellular Telephone” by Young Joon Song et al. (Aug. 18-20, 1998), the present inventor being a co-author, the article describes a correlator circuit for GSM codes where the out-of-phase coefficients are all zero except one exception at zero and middle shift having a first peak and a second peak, where the first and second peaks are opposite in polarity, but the peaks are not equal to one another. Further, the article describes lowest out-of-phase coefficients of +4 and −4. However, the article does not provide how such sequences and autocorrelation can be used to achieve the above described optimal results, and the article does not provide sufficient disclosure that the sequences achieve or can achieve the lowest autocorrelation sidelobes.

As described above, the pilot patterns used as frame synchronization words or sequences do not achieve the optimal results. Further, the background pilot patterns do not rapidly and accurately perform the frame synchronization. Moreover, the above pilot patterns and frame synchronization sequences do not provide optimal cross-correlation and autocorrelation. Additionally, neither the TS specification nor the article provides a solution of the use of the pilot patterns for slot-by-slot double check frame synchronization scheme, and neither discloses the use of the frame synchronization sequence for channel estimation.

SUMMARY OF THE INVENTION

An object of the present invention is to obviate at least the problems and disadvantages of the related art.

An object of the present invention is to provide frame synchronization words resulting in optimal autocorrelation results.

A further object of the present invention is to eliminate or prevent sidelobes.

A further object of the present invention is to provide maximum values at zero and middle time shifts.

Another object of the present invention is to provide a synchronization word for at least one of rapid and accurate frame synchronization.

Another object of the present invention is to provide a slot-by-slot double check frame synchronization scheme.

Still another object of the present invention is to provide a frame synchronization word which can be used for channel estimation.

Still another object of the present invention is to provide good cross-correlation and autocorrelation simultaneously.

The present invention can be achieved in a whole or in parts by a method for synchronizing a frame using an optimal pilot symbol, comprising the steps of: (1) receiving a pilot symbol of each slot in the frame through respective physical channels on a communication link; (2) correlating a received position of each of the pilot symbols to a corresponding pilot sequence; (3) combining and summing more than one results of the correlations, and deriving a final result from the correlations in which sidelobes from the results of the correlations are offset; and (4) synchronizing the frame using the final result.

The pilot symbols are combined into each of the pilot sequences such that the final result of the correlations shows sidelobes with 0″ values excluding particular positions of correlation periods. The particular positions are starting points (x=0) of the correlation periods (x) and points of x/an integer. The pilot symbol is a combination of pilot symbols in a form of (a,/a). The pilot sequence provides least correlation resultants at positions excluding the starting points and half of the starting points in the correlation periods. The pilot symbols excluding the pilot symbols used in the correlation is used in a channel estimation for detecting coherent. The pilot symbol of each slot in the frame is transmitted, with the pilot symbol contained in a pilot field of an exclusive physical control channel among respective exclusive channels on the communication link. The pilot sequences different from each other on an up communication link are used in the correlation according to values of bits included in a pilot field of an exclusive physical control channel. The pilot sequences different from each other on a down communication link are used in the correlation according to a symbol rate of an exclusive physical control channel.

The present invention can be also achieved in a whole or in parts by a method for synchronizing a frame using an optimal pilot symbol, comprising the steps of: (1) receiving a pilot symbol of each slot in the frame through respective physical channels on a communication link; (2) correlating a received position of each of the pilot symbols to a corresponding pilot sequence; (3) combining and summing more than one results of the correlations, and deriving a final result from the correlations in which sidelobes from the results of the correlations have minimum values and the results of the correlations at starting points and middle points of correlation periods have maximum values with different polarity; and (4) synchronizing the frame using the final result.

The present invention can be achieved in a whole or in parts by a method of eliminating sidelobes in a communication channel between a base station and a mobile station, comprising the steps of: generating control signals and data signals within the communication channel, the control signals having a first sequence of L-bits and a second sequence of L-bits; generating a first set of prescribed values based on the first sequence, which has a first prescribed relationship with the first set of prescribed values; generating a second set of prescribed values based on the second sequence, which has a second prescribed relationship with the second set of prescribed values; and combining the first and second sets of prescribed values.

The present invention can be achieved in a whole or in parts by a method of establishing a communication channel, the method comprising the steps of: generating a plurality of frames; generating a L-number of slots for each frame, each slot having a pilot signal of N-bits and a corresponding bit in each slot forming a word of L-sequence of pilot bits such that there is N number of words, wherein the number of bit values of two pilot bits which are the same between two adjacent words from 1 to L slots minus the number of bit values of two pilot bits which are different between the two adjacent words from 1 to L is zero or a prescribed number close to zero.

The present invention can be achieved in a whole or in parts by a method of establishing a communication channel having at least one of frame synchronization and channel estimation, the method comprising the steps of: generating a plurality of frames; generating a L-number of slots for each frame, each slot having a pilot signal of N-bits and a corresponding bit in each slot forming a word of L-sequence of pilot bits such that there is N number of words, wherein the words have at least one of the following characteristics: cross-correlation between two adjacent sequences used for frame synchronization is zero at zero time shift, or cross-correlation between a word used for frame synchronization and a word used for channel estimation is zero at all time shifts.

The present invention can be achieved in a whole or in parts by a method of reducing sidelobes for frame synchronization, comprising the steps of: generating a plurality of frame synchronization words, each frame synchronization word having a plurality of bits; performing autocorrelation functions on a pair of frame synchronization words to generate a pair of prescribed value sets; and combining the pair of prescribed value sets such that two peak values equal in magnitude and opposite in polarity are achieved at zero and middle time shifts.

The present invention can be achieved in a whole or in parts by a method of generating pilot signals of a prescribed pattern within a frame having L-number of slots, comprising the steps of: generating N-number of pilot bits for each slot; and forming N-number of words of L-bit based on above step, wherein a prescribed number of words is used for frame synchronization words and each frame synchronization word has a first prescribed number b₀ of bit values of “0” and a second prescribed number b₁ of bit values of “1”, such that b₁−b₀ is equal to zero or a number close to zero.

The present invention can be achieved in a whole or in parts by a communication link between a user equipment and a base station comprising a plurality of layers, wherein one of the layers is a physical layer for establishing communication between the user equipment and the base station and the physical layer has at least one of data and control information, one of the control information being a pilot field of N-bits transmitted for L-number of slots such that N-number of words of L-bit are formed, wherein cross-correlation between two adjacent words used for frame synchronization is zero at zero time shift or cross-correlation between a word used for frame synchronization and a word used for channel estimation is zero at all time shifts.

The present invention can be achieved in a whole or in parts by a correlator circuit for at least one of a user equipment and a base station, comprising: a plurality of latch circuits, each latch circuit latching a word formed by a pilot bit from a plurality of slots; a plurality of correlators, each correlator coupled to a corresponding latch circuit and correlating the word to a set of prescribed values; and a combiner that combines the set from each correlator such that maximum peak values of equal in magnitude and opposite in polarity are formed at zero and middle time shifts.

The present invention can be achieved in a whole or in parts by a communication device comprising: means for transmitting at least one of data and control information; means for receiving at least one of data and control information, wherein the receiving means includes: a plurality of latch circuits, each latch circuit latching a word formed by a pilot bit from a plurality of slots; a plurality of correlators, each correlator coupled to a corresponding latch circuit and correlating the word to a set of prescribed values; a plurality of buffers, each buffer coupled to a corresponding correlator to store the set of prescribed values; and a combiner that combines the set from each buffer such that maximum peaks of equal in magnitude and opposite in polarity are formed at zero and middle time shifts.

An object of the present invention is to provide a method of generating pilot sequences having double lengths of slots used for frame synchronization and defined by 4+2(l=1, 2, 3, . . . ), while providing a mathematical method of generating code sequences of slot length.

To achieve these and other advantages and in accordance with the purpose of the present invention, as embodied and broadly described, a method of generating pilot sequences for frame synchronization according to the present invention includes the steps of selecting a bit length of pilot sequences used for frame synchronization, selecting a first code sequence indicative of a maximum correlation value at a specific delay point of a correlation period and indicative of a minimum correlation value at the other delay points excluding the specific delay point, selecting a second code sequence indicative of the same correlation characteristic as the selected code sequence, and combining the selected code sequences to generate pilot sequences having the selected bit length.

The second code sequence shifts the first code sequence by a certain bit length and inverts the same. The code sequences indicate maximum correlation values corresponding to their bit lengths at a matched delay point of the correlation period and indicate minimum correlation values at the other delay points excluding the matched delay point and having polarities opposite to the maximum correlation values.

In another aspect, a method of generating pilot sequences for frame synchronization according to the present invention includes the steps of selecting a bit length N of pilot sequences as 4l+2(l=1,2,3, . . . ), selecting a first code sequence of N/2 bit length indicative of a maximum correlation value N/2 at a specific delay point of a correlation period and indicative of a minimum correlation value at the other delay points excluding the specific delay point, selecting a second code sequence of N/2 bit length by shifting the first code sequence by l+1 bit length and inverting the same, and combining the selected code sequences to generate pilot sequences having the selected bit length.

Preferably, the generated pilot sequences indicate a correlation value N corresponding to their bit length N at a matched delay point of their correlation periods and indicate another correlation value −N having the same size as the correlation value N and opposite polarity to the correlation value N at the delayed point by half period of their correlation periods.

The generated pilot sequences indicate correlation values which are integer multiple of the minimum correlation value of the selected code sequence at the other delay points excluding the delay point which indicates the correlation value N or −N.

Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objects and advantages of the invention may be realized and attained as particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described in detail with reference to the following drawings in which like reference numerals refer to like elements wherein:

FIG. 1 generally illustrates a system, which uses CDMA modulation techniques in communication between user and base stations;

FIG. 2 illustrates these three different propagation phenomena;

FIG. 3 depicts a block diagram of a transmitter and a receiver for time multiplexed pilot symbols;

FIG. 4 illustrates a frame structure of an uplink DPCH based on the 3GPP RAN standard;

FIG. 5 is a table showing various information of the uplink DPCCH;

FIG. 6 is a table illustrating pilot bit patterns of the uplink DPCCH;

FIG. 7 shows a spreading/scrambling arrangement for the uplink DPCH based on the 3GPP RAN standard;

FIG. 8 illustrates a frame structure of a downlink DPCH based on the 3GPP RAN standard;

FIG. 9 is a table illustrating pilot symbol patterns contained in the downlink DPCCH;

FIG. 10 illustrates a spreading/scrambling arrangement for the downlink DPCH based on the 3GPP RAN standard;

FIGS. 11A and 11B illustrate the frame structure of PCCPCH and SCCPCH, respectively;

FIG. 12A is a table illustrating the frame synchronization words C₁ to C_(i-th) in accordance with a preferred embodiment of the present invention;

FIG. 12B is a table illustrating the autocorrelation function of the sequences of pilot bits;

FIG. 13A illustrates addition of two autocorrelation functions;

FIG. 13B illustrates addition of the four autocorrelation functions;

FIGS. 14A and 14B are tables illustrating the pilot patterns in accordance with a preferred embodiment of the present invention for uplink DPCCH;

FIG. 14C is a table illustrating the mapping relationship between the 8 synchronization words C₁-C₈ of FIG. 12A and shaded pilot bit patterns of FIGS. 14A and 14B;

FIG. 14D illustrates a correlation circuit for frame synchronization based on pilot bits of the uplink DPCCH in accordance with a preferred embodiment of the present invention;

FIG. 14E is a table illustrating the correlation results at points A₁-A₄, and the summing of the correlation results at point B of FIG. 14D.

FIG. 14F is a table illustrating various results of the addition of correlation results based on the uplink pilot patterns of the frame synchronization words in accordance with the preferred embodiment of the present invention;

FIG. 14G illustrates a correlator circuit for frame synchronization based on pilot bit sequences of an uplink DPCCH in accordance with an alternative embodiment;

FIG. 14H illustrates the receiver circuit of a base station or a user equipment to recover the received spread signal including the frame synchronization words in the pilot field;

FIG. 14I illustrates results of correlation circuit using the pilot pattern of the technical specification;

FIG. 14J illustrates a time shift graph of the summation of results of FIG. 14I;

FIG. 15A illustrates the pilot symbol patterns for downlink DPCH;

FIG. 15B illustrates the mapping relationship between the 8 frame synchronization words of FIG. 12A, and shaded pilot symbol pattern of FIG. 15A;

FIG. 15C illustrates a correlation circuit for frame synchronization for downlink DPCCH in accordance with the preferred embodiment;

FIG. 16A illustrates pilot symbol pattern of PCCPCH;

FIG. 16B illustrates the mapping relationship between the synchronization words C₁-C₈ of FIG. 12A, and the shaded pilot symbol patterns of FIG. 16A;

FIG. 16C illustrates pilot symbol pattern of SCCHPCH;

FIG. 16D illustrates the mapping relationship between the synchronization words C₁-C₈ of FIG. 12A, and the shaded pilot symbol patterns of FIG. 16C;

FIGS. 17A-17C illustrate addition of autocorrelation functions of frame synchronization word of the preferred embodiment and current pilot patterns (described in TS S1.11 v1.1.0 specification) for DPCHs and PCCPCH;

FIG. 18A illustrates the parameters used for obtaining P_(D), P_(FA), and P_(S) on uplink DPCCH and downlink DPCH over additive white Gaussian noise (AWGN);

FIG. 18B illustrates the probability of detection P_(D) on downlink DPCCH over AWGN channel;

FIG. 18C illustrates the probability of false alarm P_(FA) on downlink DPCCH over AWGN channel;

FIG. 18D illustrates the probability of a frame synchronization confirmation success P_(S) on downlink DPCCH over AWGN channel;

FIG. 19A illustrates pilot symbol patterns of downlink DPCH for the diversity antenna using a space time block coding based transmit diversity (STTD);

FIG. 19B illustrates the mapping relationship between the 8 words C₁-C₈ of FIG. 12A and shaded pilot symbol patterns of FIG. 19A;

FIG. 19C illustrates the diversity antenna pilot symbol pattern for PCCPCH;

FIG. 19D illustrates the mapping relationship between the words C₁-C₈ of FIG. 12A and shadowed pilot symbol patterns of FIG. 19C;

FIG. 19E illustrates the pilot symbol pattern for the diversity antenna when STTD encoding is used on the SCCPCH;

FIG. 19F illustrates the mapping relationship between the words C₁-C₈ of FIG. 12A and shaded pilot symbol patterns of FIG. 19E;

FIG. 20A is a table illustrating frame synchronization words C₁-C₁₆ (i=16) and autocorrelated function in accordance with another preferred embodiment of the present invention;

FIG. 20B is a table illustrating the autocorrelation function of the pilot bits of each frame synchronization word classified in the PCSP;

FIG. 20C illustrates the pilot bit pattern of uplink DPCCH;

FIG. 20D illustrates a mapping relationship between the alternative frame synchronization words C₁-C₁₆ of FIG. 20A and the shaded frame synchronization words of FIG. 20C;

FIGS. 20E and 20F illustrate the pilot symbol pattern of downlink DPCH;

FIG. 20G illustrates a mapping relationship between the alternative frame synchronization words C₁-C₁₆ of FIG. 20A and the shaded frame synchronization words of FIGS. 20E and 20F;

FIG. 20H illustrates the pilot symbol pattern of downlink PCCPCH;

FIG. 20I illustrates a mapping relationship between the alternative frame synchronization words C₁-C₁₆ of FIG. 20A and the shaded frame synchronization words of FIG. 20H.

FIG. 21 illustrates a preferred embodiment for the new frame synchronization words C₁-C_(i-th);

FIG. 22A illustrates the addition of two auto-correlation functions;

FIG. 22B illustrates the addition of two cross-correlation functions between the two frame synchronization words within the same class;

FIG. 22C illustrates the addition of four auto-correlation functions;

FIG. 22D illustrates the addition of four cross-correlation functions between the four frame synchronization words of two classes;

FIGS. 23A illustrates the pilot bit patterns on uplink DPCCH with N_(pilot)=2, 3, and 4;

FIG. 23C illustrates the pilot bit patterns on uplink DPCCH with N_(pilot)=2, 3, and 4 in accordance with an alternative embodiment compared to FIG. 23A;

FIGS. 23E and 23F illustrate the pilot bit patterns on uplink DPCCH with N_(pilot)=5, 6, 7, and 8;

FIGS. 23B and 23D illustrate the mapping relationship between the frame synchronization words of FIG. 21, and shaded frame synchronization words of FIGS. 23A and 23D, respectively;

FIG. 23G illustrates the mapping relationship between the frame synchronization words of FIG. 21, and the shaded frame synchronization words of FIGS. 23E and 23F;

FIG. 23H illustrates the structure of random access channel;

FIG. 23I illustrates the random access message control fields;

FIG. 23J illustrates the pilot bit pattern of the RACH;

FIG. 24A illustrates the pilot symbol patterns on downlink DPCH when N_(pilot)=2, 4, 8, and 16;

FIG. 24B illustrates the mapping relationship between the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 24A;

FIG. 24C illustrates the pilot symbol patterns of downlink DPCH for the diversity antenna using STTD;

FIG. 24D illustrates the mapping relationship between the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 24C;

FIG. 25A illustrates the pilot symbol patterns for downlink SCCPCH for N_(pilot)=8 and 16;

FIG. 25B illustrates the mapping relationship of the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 25A;

FIG. 25C illustrates the pilot symbol patterns of downlink SCCPCH for Npilot=8 and 16 for the diversity antenna using STTD;

FIG. 25D illustrates the mapping relationship between the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 25C;

FIG. 26A illustrates the parameters used to evaluate the performance of the pilot bit pattern on uplink DPCCH over AWGN;

FIG. 26B illustrates the probability of frame synchronization confirmation success P_(S) on uplink DPCCH with N_(pilot)=6 over AWGN channel;

FIG. 26C illustrates the probability of a false alarm P_(FA) on uplink DPCCH with N_(pilot)=6 over AWGN channel;

FIG. 27 is a comparision chart between the embodiments for 15 timeslots and 16 slots;

FIG. 28A is a block diagram of an STTD transmitter according to the 3GPP RAN standards;

FIG. 28B illustrates an STTD encoding based on the STTD transmitter of FIG. 28A; and

FIG. 29 is a schematic view illustrating PN code generators using a method of generating pilot sequences according to a preferred embodiment of the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

The new frame synchronization words in accordance with the preferred embodiment have the lowest out-of-phase values of autocorrelation function with two peak values equal in magnitude and opposite in polarity at zero and middle shifts. The frame synchronization words are suitable for frame synchronization confirmation since by simply adding autocorrelation functions of such words, double maximum correlation values equal in magnitude and opposite polarity at zero and middle shifts can be achieved. This property can be used to double-check frame synchronization timing and reduce the synchronization search time.

The UE establishes downlink chip synchronization and frame synchronization based on the Primary CCPCH synchronization timing and the frame offset group, slot offset group notified from the network. The frame synchronization can be confirmed using the frame synchronization word. The network establishes uplink channel chip synchronization and frame synchronization based on the frame offset group and slot offset group. The frame synchronization can also be confirmed using the frame synchronization word.

When long scrambling code is used on uplink channels or downlink channels, failure in frame synchronization confirmation using frame synchronization words always means losing frame and chip synchronizations since the phase of long scrambling code repeats every frame. Whereas in the case of short scrambling code on uplink DPCCH, failure in frame synchronization confirmation does not always implies losing chip synchronization since the length of short scrambling code is 256 and it corresponds to one symbol period of uplink DPCCH with SF=256. Thus, the frame synchronization word of pilot pattern can detect synchronization status and this information can be used in RRC Connection Establishment and Release Procedures of Layer 2.

FIG. 12A is a table illustrating the frame synchronization words C₁ to C_(i-th) in accordance with a preferred embodiment of the present invention, where each word comprises L number (L>1) of sequence of pilot bits from a prescribed bit position of the N_(pilot) bits (N_(pilot)>0) from each slot of L number of slots. In the preferred first embodiment described hereinafter, the number of synchronization words i equals 8, the number of slots L=16 and the number of pilot bits N_(pilot) in each slot is between 4 and 16, but the present invention is applicable to different variations of i, L, and N_(pilot).

The synchronization words C₁-C₈ of the preferred embodiment can be divided into 4 classes (E-H, referred to as Preferred Correlation Sequence Pair (PCSP)) according to the autocorrelation function of the synchronization words, as follows:

E = {C₁, C₅} F = {C₂, C₆} G = {C₃, C₇} H = {C₄, C₈}

FIG. 12B is a table illustrating the autocorrelation function of 1 to 16 sequences of pilot bits of each frame synchronization word classified in classes E, F, G and H within one correlation period from a time shift of 0 to 15. As shown in FIGS. 12A and 12B, each class contains 2 sequences, and sequences of the same class have the same autocorrelation function. From FIG. 12B, the synchronization words have the lowest out-of-phase values of autocorrelation function with two peak values equal in magnitude and opposite in polarity at zero and middle shifts. Moreover, the results R₁ and R₂ of the autocorrelation function are complements of each other. The following relationships between the autocorrelation functions are expressed in equations (1)-(4): $\begin{matrix} {{{R_{E}(\tau)} = {{R_{F}(\tau)} = {{R_{G}(\tau)} = {R_{H}(\tau)}}}},{\tau \quad {is}\quad {even}}} & (1) \\ {{{R_{E}(\tau)} = {- {R_{F}(\tau)}}},{\tau \quad {is}\quad {odd}}} & (2) \\ {{{R_{G}(\tau)} = {- {R_{H}(\tau)}}},{\tau \quad {is}\quad {odd}}} & (3) \\ {{{{R_{i}(\tau)} + {R_{i}\left( {\tau + 8} \right)}} = 0},{i \in \left\{ {E,F,G,H} \right\}},{{for}\quad {all}\quad \tau}} & (4) \end{matrix}$

From equations (1), (2), and (3), the following equation is obtained.

R _(E)(τ)+R _(F)(τ)=R _(G)(τ)+R _(H)(τ), for all τ  (5)

The addition of two autocorrelation functions R_(E)(τ) and R_(F)(τ), or R_(G)(τ) and R_(H)(τ) becomes the function with two peak values equal in magnitude and opposite in polarity at zero and middle shifts, and all zero values except the zero and middle shifts, which is depicted in FIG. 13A, where the peak values equal 2*L or −2*L. In the preferred embodiment, the peak values of FIG. 13A are 32 and −32, since L=16. The other combinations such as (R_(E)(τ)+R_(G)(τ)), (R_(E)(τ)+R_(H)(τ)), (R_(F)(τ)+R_(G)(τ)), and (R_(F)(τ)+R_(H)(τ)) do not have the same value as in FIG. 13A. By using the derived properties of the frame synchronization words, the following property is achieved. $\begin{matrix} {{{\sum\limits_{i = 1}^{2\alpha}{R_{i}(\tau)}} = {\alpha \cdot \left( {{R_{E}(\tau)} + {R_{F}(\tau)}} \right)}},{1 \leq \alpha \leq 4}} & (6) \end{matrix}$

where R_(i)(τ) is the autocorrelation function of sequence C_(i), 1≦i≦8.

The addition of the four autocorrelation functions is illustrated in FIG. 13B, which is the same as FIG. 13B except that the maximum value is doubled to 4*L or −4*L (the maximum values being 64 and −64 for the preferred embodiment) since (R_(E)(τ)+R_(F)(τ)+R_(G)(τ)+R_(H)(τ))=2(R_(E)(τ)+R_(F)(τ)) by equations (5) and (6). This property allows the double-checking of the frame synchronization timing and the reduction of the synchronization search time.

First Embodiment for Uplink DPCCH

FIGS. 14A and 14B are tables illustrating the pilot patterns in accordance with a preferred embodiment of the present invention for uplink DPCCH with N_(pilot)=5, 6, 7, and 8. The shaded pattern of FIGS. 14A and 14B are used for frame synchronization (which can also be used for channel estimation), and the pilot bit other than the frame synchronization words (e.g., channel estimation) has a value of 1. FIG. 14C is a table illustrating the mapping relationship between the 8 synchronization words C₁-C₈ of FIG. 12A and shaded pilot bit patterns of FIGS. 14A and 14B, where frame synchronization words C₁, C₂, C₃, and C₄ are the elements of the set {E, F, G, and H}, respectively. The results of FIGS. 13A and 13B are obtained by α=1 and 2 in equation (6), respectively, which allows a double-check of the frame synchronization timing and a reduction of the synchronization time on uplink DPCCH with N_(pilot)=5, 6, 7, and 8.

For example, the frame synchronization words at bit #1 (C₁), at bit #2 (C₂), at bit #4 (C₃) and at bit #5 (C₄) are used in the autocorrelation process for the frame synchronization when N_(pilot)=6. For N_(pilot)=8, the frame synchronization words at bit #1 (C₁), at bit #3 (C₂), at bit #5 (C₃) and at bit #7 (C₄) are used in the autocor process for the frame synchronization. For N_(pilot)=5, 6, 7, and 8 in each slot, a total of four frame synchronization words are used. As a result, since one radio frame has sixteen timeslots, the number of pilot bits used for the frame synchronization is only 64 per frame in the preferred embodiment. As can be appreciated, the number of words used for frame synchronization can vary depending on variations of N_(pilot). For example, when N_(pilot)=1, one of the frame synchronization words C₁-C₈ can be used for both frame synchronization and channel estimation due to the novel feature of the preferred embodiment.

With the implementation of the novel pilot patterns, the values for the number of bits per field are shown below in Table 1 and Table 2, with reference to FIG. 4. The channel bit and symbol rates given in Table 1 are the rates immediately before spreading.

TABLE 1 DPDCH fields Channel Channel Bit Symbol Rate Bits/ Bits/ Rate (kbps) (ksps) SF Frame Slot N_(data) 16 16 256 160 10 10 32 32 128 320 20 20 64 64 64 640 40 40 128 128 32 1280 80 80 256 256 16 2560 160 160 512 512 8 5120 320 320 1024 1024 4 10240 640 640

There are two types of Uplink Dedicated Physical Channels; those that include TFCI (e.g. for several simultaneous services) and those that do not include TFCI (e.g. for fixed-rate services). These types are reflected by the duplicated rows of Table 2. The channel bit and symbol rates given in Table 2 are the rates immediately before spreading.

TABLE 2 DPCCH fields Channel Bit Channel Symbol Bits/ Bits/ Rate (kbps) Rate (ksps) SF Frame Slot N_(pilot) N_(TPC) N_(TFCI) N_(FBI) 16 16 256 160 10 6 2 2 0 16 16 256 160 10 8 2 0 0 16 16 256 160 10 5 2 2 1 16 16 256 160 10 7 2 0 1 16 16 256 160 10 6 2 0 2 16 16 256 160 10 5 1 2 2

FIG. 14D illustrates a correlation circuit for frame synchronization based on pilot bits of the uplink DPCCH in accordance with a preferred embodiment of the present invention when frame synchronization words C₁-C₄ are used. The frame synchronization words C₁-C₄ are latched in latch circuits 31-34, respectively. The correlators 41-44 perform correlation function R(x), where x=0 to L−1, of the frame synchronization words C₁-C₄, respectively, to generate the correlation results A₁-A₄, which are stored in buffers 51-53.

FIG. 14E is a table illustrating the correlation results at points A₁-A₄, and the summing of the correlation results at point B. As shown, the result has maximum values of opposite polarity at zero and middle time shifts R(0) and R(8). Further, the remaining sidelobes at time shifts other than zero and middle have values of zero after the addition at point B. The sidelobes are eliminated or minimized, and the results at point B correspond to the optimal results of FIG. 13B.

FIG. 14F is a table illustrating various results of the addition of correlation results of points A₁-A₄ based on the uplink pilot patterns of the frame synchronization words C₁-C₄ in accordance with the preferred embodiment of the present invention. The respective addition of the autocorrelation results of points (A₁+A₂), (A₃+A₄), (A₁+A₄) and (A₂+A₃) exhibit the same characteristics of the optimal results illustrated in FIG. 13A.

FIG. 14G illustrates a correlator circuit for frame synchronization based on pilot bit sequences of an uplink DPCCH in accordance with an alternative embodiment. The elements are the same as the correlator circuit of FIG. 14D. The frame synchronization words of (C₁ and C₂), (C₂ and C₃), (C₃ and C₄), or (C₄ and C₁) are correlated and summed to provide the results at point D. The summation result at point D of FIG. 14G is similar to the correlator circuit of FIG. 14D other than the maximum values of opposite polarity being 2*L (32) and −2*L (−32), rather than 4*L (64) and −4*L (−64), respectively, corresponding to the results of FIG. 14F and optimal results of FIG. 13A.

FIG. 14H illustrates the receiver circuit 60 of a base station or a user equipment to recover the received spread signal including the frame synchronization words in the pilot field. After despreading the received spread signal by the despreading circuit 61, the channel estimator and frame synchronizer 62 performs the channel estimation and the frame synchronization based on the pilot field. The Rake combiner 63 uses the results of the channel estimator and frame synchronizer, and after rake combining, the data is deinterleaved by the deinterleaving circuit 64 in the reverse order of the transmitter side. Thereafter, the data is recovered after decoding by a decoder 65.

The advantages of the present invention can be readily discerned based on comparison of the frame synchronization words previously recommended in TS S1.11 v1.1.0 specification and the frame synchronization words for, e.g., N_(pilot)=6. Applying the same principle of equations (1)-(6) and the correlator circuit of FIG. 14D, the results in FIG. 14I are obtained for the pilot pattern indicated in the technical specification. When the summation result at point B is mapped on a time shift graph, the problem of sidelobes is readily apparent, as shown in FIG. 14J. In other words, there is no maximum peak values of opposite polarity at zero and middle time shifts, and sidelobes are present at time shifts other than zero and middle.

As described in the background art, obtaining good cross-correlation and autocorrelation simultaneous is difficult to achieve, where cross-correlation relates to different words at different time shifts and autocorrelation relates to same sequences which are time shifted version. The good cross-correlation and autocorrelation of the present invention is based on unique properties of the frame synchronization words.

The unique characteristics of the frame synchronization words in accordance with the preferred embodiment can be readily discerned in view of FIGS. 12, 14A and 14B. As shown in frame synchronization words C₁-C₈ of FIG. 12, each word has substantially the same number of 1 and 0. In other words, the number (b₁) of pilot bits of a frame synchronization words having a value of 1 minus the number (b₀) of pilot bits of the frame synchronization having a value of 0 is equal to zero or close to zero. In the preferred embodiment, when there are even number of slot numbers, there are the same number of pilot bits having a value of 1 and 0 in a single frame synchronization word such that b₁−b₀ is zero. As can be appreciated, when there are an odd number of pilot bits in a single frame synchronization word, the result of b₁−b₀ is plus or minus one, e.g., close to zero.

The second characteristic of the frame synchronization words can be discerned by an examination between a pair of adjacent frame synchronization words (shaded patterns of FIGS. 14A and 14B for N_(pilot)=5, 6, and 7), or between a pair of adjacent frame synchronization word and channel estimation word (shaded and non-shaded patterns of FIGS. 14A and 14B for N_(pilot)=5, 6, 7, and 8). Generally, the number (b₃) of bit values which are the same (0,0 and 1,1) between a pair of adjacent words (i.e., between two adjacent frame synchronization words, or between a frame synchronization word and a channel estimation word, which are adjacent) minus the number (b₄) of bit values which are different (1,0 or 0,1) between adjacent words (i.e., between two adjacent frame synchronization words, or between a frame synchronization word and a channel estimation word, which are adjacent) equals zero or a prescribed number close to zero.

In the preferred embodiment, the number (b₃) of pilot bit values which are the same between two adjacent words equals the number (b₄) of pilot bit value which are different between the two adjacent words, i.e., b₃−b₄=0. In the preferred embodiment, when the N_(pilot)=5, between two synchronization words of C₁ at bit #0 and C₂ at bit #1, there same number of pilot bit values which are the same (0,0 and 1,1) and pilot bit values which are different (1,0 and 0,1) from slot #1 to slot #16, as shown in FIG. 14A. Similarly, between a synchronization word C₂ at bit #1 and a channel estimation word at bit #2, there same number of pilot bit values which are the same (0,0 and 1,1) and pilot bit values which are different (1,0 and 0,1) from slot #1 to slot #16. The same applies between two adjacent words at bit #2 and bit #3, and between two adjacent words at bit #3 and bit #4. The above also applies to adjacent words of N_(pilot)=6, 7 and 8. As can be appreciated, when an odd number of slots are used, the result of b₃−b₄ equals plus or minus one, e.g., close to zero.

As a result of such a characteristic, cross-correlation between two adjacent words used for frame synchronization is zero (orthogonal) at zero time shift. Further, the cross-correlation between a word used for frame synchronization and the sequence used for channel estimation is zero (orthogonal) at all time shifts. In other word, within N_(pilot) number of words of L-bits, there are an even number of words used for frame synchronization, but all words perform channel estimation, wherein between adjacent words used for frame synchronization, there is substantially zero cross-correlation. Moreover, the words used for frame synchronization has substantially zero cross-correlation with words not used for frame synchronization, i.e., channel estimation, at any time shifts.

Further, each N_(pilot) words corresponds to a prescribed number by an autocorrelation function such that when a pair from a set of autocorrelated results corresponding to words used for frame synchronization is combined, two peak values equal in magnitude and opposite in polarity are achieved at zero and middle time shift while sidelobes are substantially eliminated at time shifts other than zero and middle. Autocorrelation in accordance with the present invention can be generally defined as a correlation between a word and its time shifted replica (including replica at zero time shift), where correlation is the number of bit values which are the same between two words minus the number of bit values which are different between the same two words. Further, as shown in FIG. 12B, R₁ and R₂ are complements of each other.

First Embodiment for Downlink DPCH

FIG. 15A illustrates the pilot symbol patterns for downlink DPCH for N_(pilot)=4, 8 and 16, where two pilot bits form a symbol since the left bit is used for the I channel branch and the right bit is used for the Q channel branch. In the preferred embodiment, N_(pilot)=4 can be used for 8 ksps (kilo symbols per second); N_(pilot)=8 can be used for 16, 32, 64, and 128 ksps; and N_(pilot)=16 can be used for 256, 512, and 1024 ksps. The shaded symbols of FIG. 15A can be used for frame synchronization, and the value of pilot symbol other than for frame synchronization word, e.g., channel estimation (channel estimation word), is 11. The results of FIG. 15A is obtained by allowing α=1 for N_(pilot)=4, α=2 for N_(pilot)=8, and α=4 for N_(pilot)=16 in equation (6) for downlink DPCH.

FIG. 15B illustrates the mapping relationship between the 8 frame synchronization words of FIG. 12A, and shaded pilot symbol pattern of FIG. 15A. For example, in the preferred embodiment of N_(pilot)=4, the symbol #1 includes two frame synchronization words of C₁ (for the I channel branch I-CH, i.e., left sequence of bits from slot #1 to slot #16) and C₂ (for the Q channel branch Q-CH, i.e., right sequence of bits from slot #1 to slot #16). For N_(pilot=)8 and N_(pilot)=16, the correspondence of words to channels for corresponding symbols is self-explanatory in FIG. 15B. Similar to the uplink DPCCH, slot-by-slot double-check of the frame synchronization timing and a reduction of the frame synchronization search time can be achieved by using the autocorrelation property of the pilot symbol pattern based on equation (6).

Because the frame synchronization words of the downlink DPCH is based on frame synchronization words of FIG. 12A, the characteristics described for uplink DPCCH is applicable to downlink DPCH. For example, the number (b₃) of bit values which are the same (0,0 and 1,1) between adjacent words (i.e., between synchronization word of I channel branch and synchronization word of Q channel branch of a frame synchronization symbol, or between a channel estimation word of the Q channel branch and a frame synchronization word of the I channel branch, which are adjacent, or between a frame synchronization word of the Q channel branch and a channel estimation word of the I channel branch, which are adjacent) minus the number (b₄) of bit values which are different (1,0 and 0,1) between adjacent words (i.e., between synchronization word of I channel branch and synchronization word of Q channel branch of a frame synchronization symbol, or between a channel estimation word of the Q channel branch and a frame synchronization word of the I channel branch, which are adjacent, or between a frame synchronization word of the Q channel branch and a channel estimation word of the I channel branch, which are adjacent) equals zero or a prescribed number close to zero.

For example, for N_(pilot)=8, between the symbols #0 and #1, the number of a pair of adjacent bits, i.e., one bit from the Q channel branch of the symbol #0 and one bit from the I channel branch of the symbol #1, having bit values of 1,1 and 0,0 is the same as the number of adjacent bits having bit values of 1,0 and 0,1. In other words, b₃−b₄=0. As can be appreciated, if the number of slots L is an odd number, the result of b₃−b₄ is plus or minus one, e.g., a prescribed number close to zero.

With the implementation of the novel pilot symbols, the below Table 3 shows the number of bits per slot of the various fields with reference to FIG. 8. There are basically two types of downlink Dedicated Physical Channel; those that include TFCI (e.g. for several simultaneous services) and those that do not include TFCI (e.g. for fixed-rate services). These types are reflected by the duplicated rows of Table 3. The channel bit and symbol rates given in Table 3 are the rates immediately before spreading. If there is no TFCI, then the TFCI field is left blank (*).

TABLE 3 DPDCH and DPCCH fields Channel Channel DPDCH DPCCH Bit Rate Symbol Rate Bits/Frame Bits/ Bits/Slot Bits/Slot (kbps) (ksps) SF DPDCH DPCCH TOT Slot N_(Data1) N_(Data2) N_(TFCI) N_(TPC) N_(Pilot) 16 8 512 64 96 160 10 2 2 0 2 4 16 8 512 32 128 160 10 0 2 2 2 4 32 16 256 160 160 320 20 2 8 0 2 8 32 16 256 128 192 320 20 0 8 2 2 8 64 32 128 480 160 640 40 6 24 0 2 8 64 32 128 448 192 640 40 4 24 2 2 8 128 64 64 960 320 1280 80 4 56 8* 4 8 256 128 32 2240 320 2560 160 20 120 8* 4 8 512 256 16 4608 512 5120 320 48 240 8* 8 16 1024 512 8 9728 512 10240 640 112 496 8* 8 16 2048 1024 4 19968 512 20480 1280 240 1008 8* 8 16

FIG. 15C illustrates a correlation circuit for frame synchronization for downlink DPCCH of N_(pilot)=8 in accordance with the preferred embodiment. The operation and components are the same as the correlation circuit of FIG. 14D for uplink PCCH, except for the reception of I channel branch and Q channel branch synchronization words. The results of points A₁-A₄ and point B is the same as FIG. 14E. Similarly, the sidelobes are eliminated or minimized, and the results correspond to the optimal results of FIG. 13B. Because the number of pilot symbols (or pilot bits) used for the frame synchronization is 2 symbols per slot (or 4 bit per slot), 32 pilot symbols (or 64 pilot bits) are used in each radio frame for the frame synchronization.

For N_(pilot)=4 in the downlink DPCCH, the correlator circuit of FIG. 14G can be used. In such a case, the I and Q channel frame synchronization words are inputted to the correlator circuit. The summation result would be the same as FIG. 14F, which corresponds to the optimal results of FIG. 13A. In this case, the number of pilot symbols (or pilot bits) used for the frame synchronization is 1 symbol per slot (or 2 bits per slot), and 16 symbols (or 32 pilot bits) are used in each radio frame for the frame synchronization.

As per N_(pilot)=16 in the downlink DPCCH, the correlation circuit of FIG. 15C can be expanded to accommodate the additional frame synchronization words of the I and Q channel branches of pilot symbol #5 and symbol #7. The summation result would be similar to the optimal results of FIG. 13B, but the maximum peak values of opposite polarity would be 128 (8*L) and −128 (−8*L). Further, the number of pilot symbols (or pilot bits) used for the frame synchronization is 4 symbols per slot (or 8 bits per slot), and 64 pilot symbols (or 128 pilot bits) are used in each radio frame for the frame synchronization.

First Embodiment of Downlink PCCPCH and SCCPCH

FIG. 16A illustrates pilot symbol pattern of PCCPCH. The shaded symbols can be used for frame synchronization, and the value of pilot symbol other than for frame synchronization is 11. FIG. 16B illustrates the mapping relationship between the synchronization words C₁-C₈ of FIG. 12A, and the shaded pilot symbol patterns of FIG. 16A. A double-check frame of the synchronization timing and the reduction of the synchronization search time can be achieved with α=1 or 2 in equation (6).

FIG. 16C illustrates pilot symbol pattern of SCCPCH. The shaded symbols can be used for frame synchronization, and the value of pilot symbol other than for frame synchronization is 11. FIG. 16D illustrates the mapping relationship between the synchronization words C₁-C₈ of FIG. 12A, and the shaded pilot symbol patterns of FIG. 16C.

As shown above, the frame synchronization words of PCCPCH and SCCPCH is based on the frame synchronization words C₁-C₈, and the disclosure for the uplink DPCCH and the downlink DPCH is applicable. Hence, a detailed description regarding the various characteristics including cross-correlation and autocorrelation, operations and implements are omitted since one of ordinary skill in the art can readily appreciate the present invention based on the uplink DPCCH and downlink DPCH.

As described above, the non-shaded symbols are the pilot symbols not used for frame synchronization comprises symbols of 11, and the shaded symbols are used for frame synchronization. The frame synchronization words of the pilot pattern are used for frame synchronization confirmation, and the summation of autocorrelated values for each frame synchronization words is required. The property of summation of autocorrelated values of frame synchronization words is very important.

With the implementation of the novel pilot symbols, the values for the number of bits per field are given in Table 4 with reference to FIG. 11B. The channel bit and symbol rates given in Table 4 are the rates immediately before spreading.

TABLE 4 Secondary CCPCH fields Channel Bit Channel Symbol Bits/ Bits/ Rate (kbps) Rate (ksps) SF Frame Slot N_(data) N_(pilot) N_(TFCI) 32 16 256 320 20 12 8 0 32 16 256 320 20 10 8 2 64 32 128 640 40 32 8 0 64 32 128 640 40 30 8 2 128 64 64 1280 80 72 8 0 128 64 64 1280 80 64 8 8 256 128 32 2560 160 152 8 0 256 128 32 2560 160 144 8 8 512 256 16 5120 320 304 16 0 512 256 16 5120 320 296 16 8 1024 512 8 10240 640 624 16 0 1024 512 8 10240 640 616 16 8 2048 1024 4 20480 1280 1264 16 0 2048 1024 4 20480 1280 1256 16 8

The addition of autocorrelation functions of frame synchronization word of the preferred embodiment and current pilot patterns (described in TS S1.11 v1.1.0 specification) for DPCHs and PCCPCH are depicted in FIGS. 17A (N_(pilot)=4), FIG. 17B (N_(pilot)=8) and FIG. 17C (N_(pilot)=16). As shown, the current pilot patterns have non-zero out-of-phase autocorrelation function with peak value at zero shift, whereas the frame synchronization words of the preferred embodiment have zero out-of-phase autocorrelation function with two peak values equal in magnitude and opposite in polarity at zero and middle time shifts (delays).

Correlation to a prescribed frame synchronization word is optimum method for frame synchronization. Since the frame synchronization word of pilot pattern is used for frame synchronization confirmation, the following events and parameters are used to evaluate the performance of frame synchronization confirmation using the frame synchronization words of the preferred embodiment and the current pilot patterns:

H₁: The event that the correlator output exceeds the predetermined threshold when the code phase offset between the received shadowed column frame synchronization word and its corresponding receiver stored frame synchronization word is zero.

H₂: The event that the correlator output exceeds the predetermined threshold when the code phase offset between the received shadowed column frame synchronization word and its corresponding receiver stored frame synchronization word is not zero.

H₃: One event of H₁ and no event of H₂ for one frame.

H₄: The event that the correlator output exceeds the predetermined threshold or is smaller than −1×(predetermined threshold) when the code phase offset between the received shadowed column frame synchronization word and its corresponding receiver stored frame synchronization word is 0 or 8, respectively.

H₅: The event that the correlator output exceeds the predetermined threshold or is smaller than −1×(predetermined threshold) when the code phase offset between the received shadowed column frame synchronization word and its corresponding receiver stored frame synchronization word is not 0 and 8.

H₆: One event of H₄ and no event of H₅ for one frame.

P_(D): Probability of a detection.

P_(FA): Probability of a false alarm.

P_(S): Probability of a frame synchronization confirmation success for one frame.

From the above definitions, when the current pilot pattern is used for frame synchronization confirmation, the probability of a detection and a false alarm can be expressed as:

P _(D)=Prob(H₁)  (7)

P _(FA)=Prob(H₂)  (8)

The probability of a frame synchronization confirmation success for one frame becomes P_(S)=Prob(H₃) and it can be expressed as

P _(S) =P _(D)(1−P _(FA))¹⁵  (9)

Whereas in the case of the frame synchronization words of the preferred embodiment, as has been stated, double thresholds are needed for double-check frame synchronization, and the probability of a detection and a false alarm can be expressed as:

 P _(D)=Prob(H₄)  (10)

P _(FA)=Prob(H₅)  (11)

Similarly, in the case of frame synchronization words of the preferred embodiment, the probability of a frame confirmation success for one frame becomes P_(S)=Prob(H₆) and it is given by

P _(S) =P _(D)(1−P _(FA))¹⁴  (12)

From equations (9) and (12), the probability of a frame synchronization confirmation is greatly affected by the probability of a false alarm since P_(S) is proportional to P_(D) and (1−P_(FA))¹⁴ or (1−P_(FA))¹⁵. For example, assume that P_(FA)=10⁻¹, then (1−P_(FA))¹⁴=0.2288 and (1−P_(FA))¹⁵=0.2059. Now let P_(FA)=10⁻³, then (1−P_(FA))=0.9861 and (1−P_(FA))¹⁵=0.9851. The performance of frame synchronization can be sufficiently evaluated by selecting the threshold so that the P_(FA) is much smaller than (1−P_(D)).

The parameters of FIG. 18A are used for obtaining P_(D), P_(FA), and P_(S) on uplink DPCCH and downlink DPCH over additive white Gaussian noise (AWGN). FIG. 18B illustrates the probability of detection P_(D) on downlink DPCCH with N_(pilot)=4 over AWGN channel, FIG. 18C illustrates the probability of false alarm P_(FA) on downlink DPCCH with N_(pilot=)4 over AWGN channel, and FIG. 18D illustrates the probability of a frame synchronization confirmation success P_(S) on downlink DPCCH with N_(pilot)=4 over AWGN between the pilot pattern of the preferred embodiment and the current pilot pattern, where P_(D), P_(FA), and P_(S) are given as a function of E_(b)/N₀ ratio (E_(b)=energy per bit, N₀=noise power spectral density).

The P_(D) and P_(S) of the pilot patterns of the preferred embodiment are greater than that of current pilot pattern. Furthermore, the P_(FA) of the pilot patterns in accordance with the preferred embodiment are also smaller than that of the current pilot patterns. The theoretical equations (9) and (12) are identical to simulation results of FIG. 18D. Therefore, there is significant difference between the frame synchronization performance of pilot patterns of the preferred embodiment and that of current pilot pattern. For example, from FIG. 18D, there is 3 dB gain at P_(S)=0.93 by employing the pilot patterns of the preferred embodiment.

The frame synchronization words of the preferred embodiment are especially suitable for frame synchronization confirmation. By adding the autocorrelation functions of shaded frame synchronization words, double maximum values equal in magnitude and opposite polarity at zero and middle shifts are obtained. This property can be used to slot-by-slot and double-check frame synchronization timing and reduce the synchronization search time. The performance of frame synchronization confirmation over AWGN using pilot pattern illustrate the significant differences between the frame synchronization performance of the pilot pattern of the preferred embodiment and the current pilot pattern.

First Embodiment of Downlink DPCH, PCCPCH and SCCPH for STTD Diversity

FIG. 19A illustrates new pilot symbol patterns of Downlink DPCH for the diversity antenna using a space time block coding based transmit diversity (STTD). For the diversity pilot symbol pattern on downlink DPCH, STTD is applied to the shaded pilot symbols #1 and #3 for N_(pilot)=8, and the shaded pilot symbols #1, #3, #5, and for N_(pilot)=16. The non-shaded pilot symbols #0 and #2 for N_(pilot)=8, and non-shaded pilot symbols #0, #2, #4,and #6 for N_(pilot)=16 are encoded to be orthogonal to the pilot symbol of FIG. 15A. However, the diversity pilot pattern for downlink DPCH with N_(pilot)=4 are STTD encoded since STTD encoding requires two symbols. FIG. 19B illustrates the mapping relationship between the 8 words C₁-C₈ of FIG. 12A and shaded pilot symbol patterns of FIG. 19A.

FIG. 19C illustrates the new diversity antenna pilot symbol pattern for PCCPCH. The pilot symbols of FIG. 19C are encoded to be orthogonal to the pilot symbols of FIG. 16A. FIG. 19D illustrates the mapping relationship between the words C₁-C₈ of FIG. 12A and shadowed pilot symbol patterns of FIG. 19C.

FIG. 19E illustrates the new pilot symbol pattern for the diversity antenna when STTD encoding is used on the SCCPCH. For the diversity pilot symbol pattern on SCCPCH, STTD is applied to the shaded pilot symbols #1, and #3 of N_(pilot)=8, and shaded pilot symbols #1, #3, #5 and #7 of N_(pilot)=16 in FIG. 19E, whereas the non-shaded pilot symbols #0 and #2 of N_(pilot)=8, and non-shaded #0, #2, #4, #6 of N_(pilot)=16 are encoded to be orthogonal to those of FIG. 16C. FIG. 19F illustrates the mapping relationship between the words C₁-C₈ of FIG. 12A and shaded pilot symbol patterns of FIG. 19E.

Since the above is based on words C₁-C₈, the previous discussion regarding the uplink DPCCH and downlink DPCH, PCCPCH and SCCPH is readily applicable. One of ordinary skill in the art can readily appreciate the features for downlink using diversity antenna based on previous disclosure, and a detailed disclosure is omitted.

Alternative Embodiments for Uplink DPCCH and Downlink DPCH and PCCPCH

FIG. 20A is a table illustrating frame synchronization words C₁-C₁₆ (i=16) and autocorrelated function in accordance with another preferred embodiment of the present invention. The frame synchronization words C₁-C₁₆ can be classified into the PCSP of the first embodiment, as follows: E = {C₁, C₃, C₉, C₁₁} F = {C₂, C₄, C₁₀, C₁₂} G = {C₅, C₇, C₁₃, C₁₅} H = {C₆, C₈, C₁₄, C₁₆}

The classification of the alternative frame synchronization words C₁-C₁₆ are also applicable to equations (1)-(6), and have the same properties and characteristics of the first embodiment. FIG. 20B is a table illustrating the autocorrelation function of the pilot bits of each frame synchronization word classified in the PCSP. In this particular case, each class contains four sequences and the sequences of the same class have the same autocorrelation function.

FIG. 20C illustrates the pilot bit pattern of uplink DPCCH with N_(pilot)=6 and 8 and FIG. 20D illustrates a mapping relationship between the alternative frame synchronization words C₁-C₁₆ of FIG. 20A and the shaded frame synchronization words of FIG. 20C. FIGS. 20E and 20F illustrate the pilot symbol pattern of downlink DPCH with 8, 16, 32, 64, 128, 256, 512, 1024, 2048 and 4096 ksps, and FIG. 20G illustrates a mapping relationship between the alternative frame synchronization words C₁-C₁₆ of FIG. 20A and the shaded frame synchronization words of FIGS. 20E and 20F. FIG. 20H illustrates the pilot symbol pattern of downlink PCCPCH and FIG. 201 illustrates a mapping relationship between the alternative frame synchronization words C₁-C₁₆ of FIG. 20A and the shaded frame synchronization words of FIG. 20H.

Since the above is based on alternative words C₁-C₁₆, which have the same features as the words C₁-C₈ of the first embodiment, the previous discussion regarding the uplink DPCCH and downlink DPCH, PCCPCH and SCCPH of the first embodiment is readily applicable. One of ordinary skill in the art can readily appreciate the features of this embodiment based on previous disclosure, and a detailed disclosure is omitted.

The frame synchronization words of the preferred embodiment are especially suitable for frame synchronization confirmation. By adding the autocorrelation functions of shaded frame synchronization words, double maximum values equal in magnitude and opposite polarity at zero and middle shifts are obtained. This property can be used to slot-by-slot and double-check frame synchronization timing and reduce the synchronization search time. Further the present invention allows a simpler construction of the correlator circuit for a receiver, thereby reducing the complexity of the receiver. Moreover, the present invention allows accurate establishment of the frame synchronization. Due to various advantages of the present invention, the first preferred embodiment has been accepted by the 3GPP, as shown in TS 25.211 v2.0.1, distributed June 1999, whose entire disclosure is hereby incorporated by reference therein.

Preferred Embodiment for L=15

The above pilot patterns in accordance with preferred embodiments of the present invention have various advantages including frame synchronization confirmation. In the above preferred embodiments, the physical channel of the up-link or down-link has a chip ratio of 4.096 Mcps, which results from the use of a pilot pattern based on a length of 16 slots for the frame synchronization. In other words, the chip ratio is based on a slot length of 2^(n). However, if the chip ratio changes from 4.096 Mcps to 3.84 Mcps, alternative pilot patterns are needed since one radio frame is based on a slot length of 15 slots. Hence, alternative pilot patterns are needed for 15 slots (L=15) due to OHG harmonization.

FIG. 21 illustrates a preferred embodiment for the new frame synchronization words C₁-C_(i-th), which has the auto-correlation function of lowest out-of-phase coefficient and the lowest magnitude of cross-correlation function with minus peak value at middle shift, where i=8. The frame synchronization words are used to design the regular pilot patterns and diversity antenna pilot patterns of uplink DPCH, and downlink DPCH and SCCPCH of the preferred embodiment. By using the two correlation functions, it is possible to double check frame synchronization at zero and middle shifts. When performance evaluation of single-check and double-check frame synchronization confirmation is carried out over AWGN environment, the words C₁-C₈ of FIG. 21 are suitable for frame synchronization confirmation

The frame synchronization words C₁-C₈ have the following two-valued auto-correlation function: $\begin{matrix} {{R_{i}(\tau)} = \left\{ {\begin{matrix} {15,} & {\tau = 0} \\ {{- 1},} & {\tau \neq 0} \end{matrix},{i = 1},2,\Lambda,8} \right.} & (13) \end{matrix}$

where R_(i)(τ) is the auto-correlation function of frame synchronization word C_(i). Similar to L=16, the words of FIG. 21 can be divided into 4 classes, as follows: E = {C₁, C₂} F = {C₃, C₄} G = {C₅, C₆} H = {C₇, C₈}

The two words within the same class are PCSP. The cross-correlation spectrum for the preferred pair {C₁, C₂}, {C₃, C₄}, {C₅, C₆}, or {C₇, C₈} is $\begin{matrix} {{R_{i,j}(\tau)} = \left\{ \begin{matrix} {{- 15},} & {\tau = 7} \\ {1,} & {\tau \neq 7} \end{matrix} \right.} & (14) \\ {{R_{j,i}\left( {\tau + 1} \right)} = \left\{ \begin{matrix} {{- 15},} & {\tau = 7} \\ {1,} & {\tau \neq 7} \end{matrix} \right.} & (15) \end{matrix}$

where R_(i,j)(τ) is cross-correlation function between two words of preferred pair of E, F, G, H, and i, j=1, 2, 3, . . . , 8. By combining such auto-correlation and cross-correlation functions, the following equations (16) and (17) are obtained: $\begin{matrix} {{\sum\limits_{i = 1}^{\alpha}{R_{i}(\tau)}} = \left\{ {\begin{matrix} {{\alpha \cdot 15},} & {\tau = 0} \\ {{- \alpha},} & {\tau \neq 0} \end{matrix},{\alpha = 1},2,3,\ldots \quad,8} \right.} & (16) \\ {{\sum\limits_{i = 1}^{\alpha/2}\left( {{R_{{{2i} - 1},{2i}}(\tau)} + {R_{{2i},{{2i} - 1}}\left( {\tau + 1} \right)}} \right)} = \left\{ {\begin{matrix} {{{- \alpha} \cdot 15},} & {\tau = 7} \\ {\alpha,} & {\tau \neq 7} \end{matrix},{\alpha = 2},4,6,8} \right.} & (17) \end{matrix}$

From equations (16) and (17), when α=2, FIG. 22A illustrates the addition of two auto-correlation functions, and FIG. 22B illustrates the addition of two cross-correlation functions between the two frame synchronization words within the same class. Similarly, from equations (16) and (17), when α=4, FIG. 22C illustrates the addition of four auto-correlation functions, and FIG. 22D illustrates the addition of four cross-correlation functions between the four frame synchronization words of two classes E and F.

Since the auto-correlation function of the frame synchronization words C₁-C₈ in accordance with this preferred embodiment has the lowest out-of-phase coefficient, single-check frame synchronization confirmation is feasible by applying the positive threshold value at (a) of the auto-correlation function output of FIG. 22C. Furthermore, double-check frame synchronization confirmation is also achieved by setting the negative threshold value at (b) of the cross-correlation function output of FIG. 22D.

FIGS. 23A illustrates the pilot bit patterns on uplink DPCCH with N_(pilot)=2, 3, and 4, and FIG. 23C illustrates the pilot bit patterns on uplink DPCCH with N_(pilot)=2, 3, and 4 in accordance with an alternative embodiment compared to FIG. 23A. Further, FIGS. 23E and 23F illustrate the pilot bit patterns on uplink DPCCH with N_(pilot)=5, 6, 7, and 8. The shaded parts of FIGS. 23A, 23C, 23E and 23F can be used for frame synchronization words, and the value of pilot bit other than the frame synchronization word is 1. FIGS. 23B and 23D illustrate the mapping relationship between the frame synchronization words of FIG. 21, and shaded frame synchronization words of FIGS. 23A and 23D, respectively. Further, FIG. 23G illustrates the mapping relationship between the frame synchronization words of FIG. 21, and the shaded frame synchronization words of FIGS. 23E and 23F.

The various description of above for uplink DPCCH when L=16 is readily applicable to this preferred embodiment when L=15, including the correlator circuits (with some modifications) and the generally characteristics. For example, as shown in frame synchronization words C₁-C₈ of FIG. 21, each word has substantially the same number of 1 and 0. In this preferred embodiment, the result of b₁−b₀ is plus or minus one, e.g., close to zero. Further, when the number of slots is 15, i.e., odd, the result of b₃−b₄ equals plus or minus one, e.g., close to zero. Further, since two frame synchronization words are used for N_(pilot)=2, 3, and 4 and there are fifteen timeslots in a radio frame, the number of pilot bits used for synchronization is 30 per frame. For N_(pilot)=5, 6, 7 and 8, since four synchronization words are used for fifteen timeslots in a radio frame, the number of pilot bits used for synchronization is 60 per frame. Moreover, the result of the addition of two or four auto-correlation functions and cross-correlation functions between two or four frame synchronization words corresponds to FIGS. 22A-22D.

With the implementation of the novel pilot patterns, the values for the number of bits per field are shown below in Table 5 and Table 6 with reference to FIG. 4. The Channel bit and symbol rates given in Table 5 are the rates immediately before spreading.

TABLE 5 DPDCH fields Channel Bit Channel Symbol Bits/ Bits/ Rate (kbps) Rate (ksps) SF Frame Slot N_(data) 15 15 256 150 10 10 30 30 128 300 20 20 60 60 64 600 40 40 120 120 32 1200 80 80 240 240 16 2400 160 160 480 480 8 4800 320 320 960 960 4 9600 640 640

There are two types of Uplink Dedicated Physical Channels; those that include TFCI (e.g. for several simultaneous services) and those that do not include TFCI (e.g. for fixed-rate services). These types are reflected by the duplicated rows of Table 6. The channel bit and symbol rates given in Table 6 are the rates immediately before spreading.

TABLE 6 DPCCH fields Channel Bit Channel Symbol Bits/ Bits/ Rate (kbps) Rate (ksps) SF Frame Slot N_(pilot) N_(TPC) N_(TFCI) N_(FBI) 15 15 256 150 10 6 2 2 0 15 15 256 150 10 8 2 0 0 15 15 256 150 10 5 2 2 1 15 15 256 150 10 7 2 0 1 15 15 256 150 10 6 2 0 2 15 15 256 150 10 5 1 2 2

The Random Access Channel (RACH) is an uplink transport channel that is used to carry control information from the UE. The RACH may also carry short user packets. The RACH is always received from the entire cell. FIG. 23H illustrates the structure of random access channel. The 10 ms message is split into 15 slots, each of length T_(slot)=2560 chips. Each slot has two parts, a data part that carries Layer 2 information and a control part that carries Layer 1 control information. The data and control parts are transmitted in parallel.

The data part includes 10*2^(k) bits, where k=0, 1, 2, 3. This corresponds to a spreading factor of 256, 128, 64, and 32 respectively for the message data part. The control part has 8 known pilot bits to support channel estimation for coherent detection and 2 bits of rate information. This corresponds to a spreading factor of 256 for the message control part.

With implementation of the novel pilot patterns, the values for the number of bits per field are shown in Table 7 with reference to FIG. 23H.

TABLE 7 Random-access message data fields. Channel Bit Channel Symbol Bits/ Bits/ Rate (kbps) Rate (ksps) SF Frame Slot N_(data) 15 15 256 150 10 10 30 30 128 300 20 20 60 60 64 600 40 40 120 120 32 1200 80 80

FIG. 23I illustrates the random access message control fields and there is always 8 pilot symbols per slot for channel estimation. Due to the unique characteristics of the frame synchronization words in accordance with the preferred embodiment, the frame synchronization words C₁-C₈ can be used in the pilot bit pattern of the RACH for channel estimation. FIG. 23J illustrates the pilot bit pattern of the RACH, and the mapping relationship is the same as the mapping relationship illustrated in FIG. 23G for N_(pilot)=8. Due to the novel characteristics of the frame synchronization words C₁-C₈, which can also be used solely for channel estimation, it is easy to reuse the pilot patterns, which allows commonality between different uplink channels.

FIG. 24A illustrates the pilot symbol patterns on downlink DPCH when N_(pilot)=2, 4, 8, and 16. The shaded parts of FIG. 24A can be used for frame synchronization symbols, each symbol having one frame synchronization word for the I channel branch and another frame synchronization word for the Q channel branch, and the value of pilot symbol other than the frame synchronization word is 11. FIG. 24B illustrates the mapping relationship between the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 24A.

FIG. 24C illustrates the pilot symbol patterns of downlink DPCH for the diversity antenna using STTD. For the diversity pilot symbol pattern on downlink DPCH, STTD is applied to the shaded pilot symbols #1 and #3 for N_(pilot)=8, and #1, #3, #5, and #7 for N_(pilot)=16. The non-shaded pilot symbols of #0 and #2 for N_(pilot)=8 and 0#, #2, #4 and #6 for N_(pilot=16) are encoded to be orthogonal to the pilot symbol of FIG. 24A. However, the diversity pilot pattern for downlink DPCH with N_(pilot)=4 are STTD encoded since STTD encoding requires two symbols. Since the STTD encoded pilot symbol pattern is orthogonal to ordinary pilot symbol pattern, the STTD encoded pilot pattern can also be used for antenna verification of feedback mode diversity. FIG. 24D illustrates the mapping relationship between the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 24C.

With the implementation of the novel pilot patterns, the below Table 8 shows the number of bits per slot of the various fields with reference to FIG. 8. There are basically two types of downlink Dedicated Physical Channel; those that include TFCI (e.g. for several simultaneous services) and those that do not include TFCI (e.g. for fixed-rate services). These types are reflected by the duplicated rows of Table 8. The channel bit and symbol rates given in Table 8 are the rates immediately before spreading. If there is no TFCI, then the TFCI field is left blank (*).

TABLE 8 DPDCH and DPCCH fields Channel Channel DPDCH DPCCH Bit Rate Symbol Rate Bits/Frame Bits/ Bits/Slot Bits/Slot (kbps) (ksps) SF DPDCH DPCCH TOT Slot N_(Data1) N_(Data2) N_(TFCI) N_(TPC) N_(Pilot) 15 7.5 512 60 90 150 10 2 2 0 2 4 15 7.5 512 30 120 150 10 0 2 2 2 4 30 15 256 150 150 300 20 2 8 0 2 8 30 15 256 120 180 300 20 0 8 2 2 8 60 30 128 450 150 600 40 6 24 0 2 8 60 30 128 420 180 600 40 4 24 2 2 8 120 60 64 900 300 1200 80 4 56 8* 4 8 240 120 32 2100 300 2400 160 20 120 8* 4 8 480 240 16 4320 480 4800 320 48 240 8* 8 16 960 480 8 9120 480 9600 640 112 496 8* 8 16 1920 960 4 18720 480 19200 1280 240 1008 8* 8 16

FIG. 25A illustrates the pilot symbol patterns for downlink SCCPCH for N_(pilot)=8 and 16, and FIG. 25B illustrates the mapping relationship of the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 25A. Futher, FIG. 25C illustrates the pilot symbol patterns of downlink SCCPCH Npilot=8 and 16 for the diversity antenna using STTD, and FIG. 25D illustrates the mapping relationship between the frame synchronization words C₁-C₈ of FIG. 21 and shaded pilot symbol patterns of FIG. 25C.

With the implementation of the novel pilot patterns, the values for the number of bits per field are given in Table 9 with reference to FIG. 11B. The channel bit and symbol rates given in Table 9 are the rates immediately before spreading. In the Secondary Common Control Physical Channel, it is possible to have burst transmission based on radio frame units. When burst transmission is performed, pilot symbols shall be added to the head of the burst. The number of symbols and the symbol pattern of the pilot symbols to be attached shall take the pattern of Slot #15.

TABLE 9 Secondary CCPCH fields with pilot bits Channel Bit Channel Symbol Bits/ Bits/ Rate (kbps) Rate (ksps) SF Frame Slot N_(data) N_(pilot) N_(TFCI) 30 15 256 300 20 12 8 0 30 15 256 300 20 10 8 2 60 30 128 600 40 32 8 0 60 30 128 600 40 30 8 2 120 60 64 1200 80 72 8 0 120 60 64 1200 80 64 8 8 240 120 32 2400 160 152 8 0 240 120 32 2400 160 144 8 8 480 240 16 4800 320 304 16 0 480 240 16 4800 320 296 16 8 960 480 8 9600 640 624 16 0 960 480 8 9600 640 616 16 8 1920 960 4 19200 1280 1264 16 0 1920 960 4 19200 1280 1256 16 8

As can be appreciated, the various description of above for downlink DPCH when L=16 is readily applicable to this preferred embodiment when L=15, including the correlator circuits (with some modifications) and the generally characteristics. Moreover, the result of the addition of two or four auto-correlation functions and cross-correlation functions between two or four frame synchronization words corresponds to FIGS. 22A-22D.

In order to evaluate the performance of the frame synchronization words in accordance with the preferred embodiment for 15 slots per frame, the following events and parameters are first defined:

H₁: The event that the auto-correlator output exceeds the predetermined threshold at zero slot offset.

H₂: The event that the auto-correlator output exceeds the predetermined threshold at zero slot offset or the cross-correlator output is smaller than −1×(predetermined threshold) at 7 slot offset.

H₃: The event that the auto-correlator exceeds the predetermined threshold at slot offset except zero.

H₄: The event that the cross-correlator output is smaller than −1×(predetermined threshold) at slot offset except 7.

P_(S): Probability of a frame synchronization confirmation success.

P_(FA): Probability of a false alarm.

The frame synchronization is confirmed if the output of the correlator using the frame synchronization word exceeds the predetermined threshold. The success of the frame synchronization confirmation is determined when the successive S_(R) frame synchronization is confirmed. Otherwise, the frame synchronization confirmation failure is determined. Thus, the probability of a frame synchronization confirmation success is defined by $\begin{matrix} {P_{S} = \left\{ \begin{matrix} {\left( {{Prob}\left( H_{1} \right)} \right)^{S_{R}},} & {{single}\quad {check}} \\ {\left( {{Prob}\left( H_{2} \right)} \right)^{S_{R}},} & {{double}\quad {check}} \end{matrix} \right.} & (18) \end{matrix}$

The probability of a false alarm can be expressed as $\begin{matrix} \begin{matrix} {P_{FA} = {{Prob}\left( H_{3} \right)}} \\ {= {{Prob}\left( H_{4} \right)}} \end{matrix} & (19) \end{matrix}$

The parameters of FIG. 26A are used to evaluate the performance of the pilot bit pattern on uplink DPCCH over AWGN. FIG. 26B illustrates the probability of frame synchronization confirmation success P_(S) on uplink DPCCH with N_(pilot)=6 over AWGN channel. Further, FIG. 26C illustrates the probability of a false alarm P_(FA) on uplink DPCCH with N_(pilot)=6 over AWGN channel. The P_(S) and P_(FA) are given as a function of E_(b)/N₀ ratio (E_(b)=energy per bit, N₀=noise power spectral density).

The P_(S) of single-check and double-check frame synchronization confirmation with S_(R)=3 on uplink DPCCH is smaller than 0.945 and 0.99 at −5 dB, respectively. Further, about 4 dB gain is obtained by employing double-check method compared to single-check method. From FIG. 26C, the probability of a false alarm with normalized threshold=0.6 at −5 dB is smaller than 2.5×10⁻⁴. The pilot pattern can be used for frame synchronization confirmation since perfect frame synchronization confirmation success with zero false alarm was detected at Eb/No=0 dB when double-check frame synchronization confirmation method was used.

FIG. 27 is a comparision chart between the embodiments for 15 timeslots and 16 slots. Including the various advantages for L=16, the pilot bit/symbol patterns for L=15 in accordance with the preferred embodiment have additional advantages. By using this property/characteristics of the frame synchronization words, double-check frame synchronization scheme can be obtained. There is significant gain about 4 dB by employing the double-check frame synchronization confirmation method compared to single-check method. However, in the case of 15 slots, the complexity of the correlator circuit is doubled since an auto-correlator for positive peak detection and a cross-correlator for negative peak detection are used.

Since the auto-correlation function of the frame synchronization words of the 15 slots has the lowest out-of-phase coefficient, the single-check frame synchronization confirmation method can also be employed; whereas, in the case of 16 slots, there is some problems due to +4 or −4 out-of-phase coefficients. The pilot patterns of 15 slots is very suitable for frame synchronization confirmation since perfect frame synchronization confirmation success with zero false alarm was detected at Eb/No=0 dB on uplink DPCH when double-check frame synchronization confirmation method was used. Due to the various advantageous of the preferred embodiment, the pilot bit/symbol patterns of 15 slots have been again accepted by the 3GPP.

STTD Encoding for Downlink

The 3GPP RAN has a description in TS s1.11 v1.1.0 on a downlink physical channel transmit diversity on application of a open loop transmit diversity and a closed loop transmit diversity in different downlink physical channels. The open loop transmit diversity uses STTD encoding based on spatial or temporal block coding. As described above, the present invention suggest new downlink pilot patterns using the STTD encoding into consideration. The STTD encoding is used optionally at the base station and preferably required at the user equipment.

FIG. 28A illustrates a block diagram of an STTD transmitter 60 according to the 3GPP RAN standards for open loop transmit diversity. A data provided to the STTD transmitter in a non-diversity mode passes through a channel encoder 61 for channel coding, a rate matcher 62 for rate matching, and an interleaver 63 for interleaving, and therefrom to a first multiplexer 64. The multiplexer 64 multiplexes a final interleaved data, a TFCI field, and a TPC field. The STTD encoder 65 provides data patterns to be respectively transmitted through a first transmission antenna 67 and a second transmission antenna 68 to a second multiplexer 66. In other words, the second multiplexer 66 has symbols S₁ and S₂ by QPSK provided thereto together with symbols −S₂* and S₁* produced to be orthogonal to the symbols S₁ and S₂.

FIG. 28B explains an STTD encoding of an STTD transmitter 60 according to the 3 GPP RAN standards. For example, it is assumed that QPSK symbols provided to the STTD encoder 65 is “S₁=1 1” in a first symbol period 0 T, and “S₂=1 0” in a second symbol period T 2T. The symbols produced to be orthogonal to the QPSK symbols at the STTD encoder 65 is “0 0” in the first symbol period 0 T, and “1 0” in the second symbol period T 2T.

The symbols produced according to the STTD encoding have the following characteristics. The symbols “0 0” produced in the first symbol period 0 T are symbols converted from QPSK symbols S₂ in the second symbol period T 2T provided to the STTD encoder 65, and the symbols “1 0” produced in the second symbol period T 2T are symbols converted from the QPSK symbols S₁ in the first symbol period 0 T provided to the STTD encoder 65.

The symbols “−S₂* and S₁*” are produced in respective symbol periods through shifting, complementary and conversion process according to the STTD encoding. Eventually, since the symbols “−S₂* and S₁*=0 0, 1 0” and the QPSK symbols S₁ and S₂=1 1, 1 0 provided to the STTD encoder 65 have correlation values “0”, they are orthogonal to each other.

The STTD encoded pilot symbol patterns of FIG. 19A are orthogonal to the pilot symbol patterns of FIG. 15A and a method for producing the pilot symbol patterns of FIG. 19A by applying the STTD encoding principle to the pilot symbol patterns of FIG. 15A will be explained with reference to FIG. 28B.

The STTD encoding is preferably carried out in units of two symbols as bundles. In other words, if it is assumed that the two symbols are “S₁=A+jB” and “S₂=C+jD”, the STTD encoding is carried out with S₁ and S₂ tied as a unit. In this instance, “A” and “C” are pilot bits for the I channel branch and “B” and “C” are pilot bits for the Q channel branch. An STTD encoding of “S₁ S₂” produces “−S₂*S₁*” (where * denotes a conjugate complex). At the end of the encoding, the STTD encoded two symbols will be “−S₂=−C+jD” and “S₁*=A−jB”.

Specifically, when the symbol rate is 8 ksps (N_(pilot)=4) of FIG. 15A, “S₁=1+j, S₂=C₁+jC₂” of respective symbol #0 and symbol #1 are STTD encoded into “−S₂*=−C₁+jC₂” of symbol #0 and “S₁*=1−j0” of symbol #1. When symbol rate is 16, 32, 64 or 128 ksps (N_(pilot)=8) in FIG. 15A, “S₁=C₁+jC₂, S₂=C₃+jC₄” at symbol #1 and symbol #3 are STTD encoded into “−S₂*=−C₃+jC₄” of symbol #1 and “S₁*=C₁−jC₂” of symbol #3 of FIG. 19A. The non-shaded symbol #0 and symbol #2 in FIG. 19A are made orthogonal to the non-shaded symbol #0 and symbol #2 in FIG. 15A. In other words, “11”, “11” in FIG. 15A are made to be “11”, “00” in FIG. 19A.

When the symbol rate is 256, 512, 1024 ksps (N_(pilot)=16), there are four shaded pilot symbols. Therefore, the pilot symbols are STTD encoded by two shaded symbols, e.g., “S₁=C₁+jC₂, S₂=C₃+jC₄” of shaded symbol #1 and symbol #3 of FIG. 19A, are STTD encoded into “−S₂*=−C₃+jC₄” of symbol #1 and “S₁*=C−jC₂” of symbol #3 of FIG. 19A, and “S₁=C₅+jC₆, S₂=C₇+jC₈” of a third and a fourth shaded symbol #5 and symbol #7 of FIG. 15A, are STTD encoded into “−S₂*=−C₇+jC₈” of symbol #5 and “S₁=C₅−jC₆” of symbol #7 of FIG. 19A. The non-shaded symbol #0, symbol #2, symbol #4, and symbol #6 of FIG. 19A, are orthogonal to the non-shaded symbol #0, symbol #2, symbol #4, and symbol #6 of FIG. 15A. That is, “11”, “11”, “11”, “11” of FIG. 15A are made into “11”, “00”, “11”, “00” of FIG. 19A.

The symbols of FIG. 19A which is produced by applying the STTD encoding to the pilot symbol patterns in FIG. 15A have the following characteristics. In FIG. 15A, when the symbol rate is 8 ksps (N_(pilot)=4), 16, 32, 64, or 128 ksps (N_(pilot)=8), or 256, 512, or 1024 ksps (N_(pilot)=16), the shaded column sequences are classed into four PCSP ‘E’, ‘F’, ‘G’ or ‘H’ starting from the lowest symbol number, and the column sequences comprises words C₁, C₂, C₃, and C₄ and C₅, C₆, C₇, and C₈ in accordance with the preferred embodiment in an order corresponding to the classes, to express each PCSP as E={C₁, C₅}, F={C₂, C₆}, G={C₃, C₇}, and H={C₄, C₈}, as described above. Since the pilot symbol patterns of FIG. 19A are the pilot symbol patterns in FIG. 15A after the STTD encoding, when the symbol rate is 256, 512, or 1024 ksps (N_(pilot)=16), the column sequences are arranged in “−C₃, C₄, C₁, and −C₂” and “−C₇, C_(8, C) ₅, −C₆” when the shaded column sequences are classed in ‘E’, ‘F’, ‘G’ or ‘H’ starting from the lowest symbol number. Hence, E={−C₃, −C₇}, F={C₄, C₈}, G={C₁, C₅}, and H={−C₂, −C₆}. Compare FIGS. 15B and 19B.

As per the non-shaded pilot symbol patterns, when each slot has 4 pilot bits, “10” is allocated to all slots of symbol #1. When each slot has 8 pilot bits, “11” is allocated to all slots of symbol #0, and “00” to all slots of symbol #2. When each slot has 16 pilot bits, “11” is allocated to all slots of symbol #0, “00” to all slots of slot #2,“11” is allocated to all slots of symbol #4, and “00” to all slots of symbol #6. Accordingly, cross correlation of the non-shaded symbols of FIG. 19A, i.e., the column sequences having “10(N_(pilot)=4 bits)”, “11(N_(pilot)=8 bits and N_(pilot)=16 bits)”, or “00(N_(pilot)−8 bits and N_(pilot)=16 bits)”, with the shaded column sequences have values “0” for all time shifts “ ”. Further, when a slot has 4, 8, or 16 pilot bits, the present invention arranges the pilot symbol patterns such that a cross correlation of a word of I channel branch and a word of a Q channel branch in every symbol number is “0” at a time shift “=0”.

The above description of STTD encoding is readily applicable to downlink PCCPCH (compare FIGS. 16A and 19C) and downlink Secondary CCPCH (compare FIGS. 16C and 19E) for 16 slots. Further, the STTD encoding is readily applicable to downlink DPCH (compare FIGS. 24A and 24C) and downlink SCCPCH (compare FIGS. 25A and 25C) for 15 slots.

Pilot Pattern Generation

In the present invention, an optimal pilot pattern for frame synchronization is generated in case that chip rate of 3.84 Mcps not 4.096 Mcps (16 slot length) is used in a physical channel of an up or down link. Particularly, in the present invention, in case that chip rate of 3.84 Mcps is used in a physical channel of a communication link and a pilot pattern of 15 slot length is needed for frame synchronization, pilot sequence codes having double length N (i.e., 2*15=30 slot length) of 15 slots is generated by an apparatus of the preferred embodiment and received for frame synchronization by the receiver.

It is defined that the pilot sequence code A and pilot sequence code B having double length N of slots have the length of 4l+2. The pilot sequences of the slot length become 2l+1. For example, L=2l+1=15 when l=7 and N=4l+2=2L=30.

In the present invention, the pilot sequences C₁ and C₂ of 2l+1 length are expressed by the following equation 20.

C ₁=(C _(1,1) , C _(1,2) , C _(1,3) , . . . , C _(1,l) , . . . , C _(1,2l+1))

C ₂=(C _(2,1) , C _(2,2) , C _(2,3) , . . . , C _(1,l) , . . . , C _(2,2l+1))  [Equation 20]

In equation 20, the pilot sequence C₂ is generated from the pilot sequence C₁ based on the following.

C ₂ =−T ^(l+1) C ₁  [Equation 21]

In equation 21, T indicates left cyclic shift, “−” indicates inversion for indicating a binary sign as a complementary of 1. Finally, the pilot sequence C₂ is generated by left cyclic shifting the pilot sequence C₁ by l+1 and at the same time inverting the same. In other words, the pilot sequence C₂ is generated by the following. $\begin{matrix} \begin{matrix} {C_{2} = {\left( {C_{2,1},C_{2,2},C_{2,3},\ldots \quad,C_{2,l},\ldots \quad,C_{2,{{2\lambda} + 1}}} \right) = {{- T^{l + 1}}C_{1}}}} \\ {= \left( {{- C_{1,{l + 2}}},{- C_{1,{l + 3}}},\ldots \quad,{- C_{1,{{2l} + 1}}},{- C_{1,1}},\ldots \quad,{- C_{1,{l + 1}}}} \right)} \end{matrix} & \left\lbrack {{Equation}\quad 22} \right\rbrack \end{matrix}$

The pilot sequence code A having 4l+2 length is defined by the above pilot sequence C₁ and pilot sequence C₂. $\begin{matrix} \begin{matrix} {A = \left( {a_{1},a_{2},a_{3},\ldots \quad,a_{{4l} + 1},a_{{4l} + 2}} \right)} \\ {= \left( {C_{1,1},C_{2,1},C_{1,2},C_{2,2},\ldots \quad,C_{1,{2l}},C_{2,{2l}},C_{1,{{2l} + 1}},C_{2,{{2l} + 1}}} \right)} \end{matrix} & \left\lbrack {{Equation}\quad 23} \right\rbrack \end{matrix}$

To generate the code A, it is necessary to define sequence C₁.

The sequence C₁ has auto-correlation characteristic of equation 24 or equation 25. The sequence C₂ also has the same auto-correlation characteristic. $\begin{matrix} {{{R_{C1}(t)} = {\begin{pmatrix} {{N/2},} & {\tau = 0} \\ {1,} & {\tau \neq 0} \end{pmatrix}\quad {where}}},{l = 2},4,6,\ldots} & \left\lbrack {{Equation}\quad 24} \right\rbrack \\ {{{R_{C1}(t)} = {\begin{pmatrix} {{N/2},} & {\tau = 0} \\ {1,} & {\tau \neq 0} \end{pmatrix}\quad {where}}},{l = 1},3,5,\ldots} & \left\lbrack {{Equation}\quad 25} \right\rbrack \end{matrix}$

The following equations 26 and 27 illustrate auto-correlation characteristic of the code A. $\begin{matrix} {{R_{A}(t)} = {{{\begin{pmatrix} {N,} & {\tau = 0} & \quad \\ {{- N},} & {\tau = {{2l} + 1}} & \quad \\ {{- 2},} & {{\tau = {odd}},} & {\tau \neq {{2l} + 1}} \\ {2,} & {{\tau = {even}},} & {\tau \neq 0} \end{pmatrix}\quad {where}},{l = 2},4,6,\ldots}}} & \left\lbrack {{Equation}\quad 26} \right\rbrack \\ {{R_{A}(t)} = {{{\begin{pmatrix} {N,} & {\tau = 0} & \quad \\ {{- N},} & {\tau = {{2l} + 1}} & \quad \\ {2,} & {{\tau = {odd}},} & {\tau \neq {{2l} + 1}} \\ {{- 2},} & {{\tau = {even}},} & {\tau \neq 0} \end{pmatrix}\quad {where}},{l = 1},3,5,\ldots}}} & \left\lbrack {{Equation}\quad 27} \right\rbrack \end{matrix}$

If there exist a sequence C₁ (or sequence C₂) having auto-correlation characteristic shown in the equations 24 and 25, there essentially exists a code A having auto-correlation characteristic shown in the equation 26 or 27.

According to the sequence C₁ (or sequence C₂) having 2l+length and the code A having 4l+2 length, each bit of the code A can be expressed as follows.

A=(a ₁ , a ₂ , a ₃ , . . . , a _(N/2) , a _(N/2+1) , . . . , a _(N))

C ₁=(a ₁ , a ₃ , a ₅ , . . . , a _(N/2) , −a ₂ , −a ₄ , . . . , a _(N))

C ₂=(a ₁ , a ₂ , a ₃ , . . . , −a ₁ , −a ₃ , −a ₅ , . . . , a _(N))  [Equation 28]

In equation 28, if the code length is N, the code A can be expressed as follows:

A=(a ₁ , a ₂ , a ₃ , . . . , a _(N/2) , a ₁ , . . . , a _(N/2))  [Equation 29]

Based on equations 28 and 29, the rules shown in the following equations 30 and 31 can be noted.

R _(C1)(j)+R _(C2)(j)=R _(A)(2j), where, j is integer  [Equation 30]

R _(C1,C2)(0)=−R _(C1)(l+1)=1/2R _(A)(1) (1)

R _(C1,C2)(1)=−R _(C1)(l+2)=1/2R _(A)(3) (2)

.

:

R _(C1,C2)(l)=−R _(C1)(2l+1)=−R _(C1)(0)=1/2R _(A)(2l+1) (3)

.

:

R _(C1,C2)(2l)=−R _(C1)(l)=1/2R _(A)(4l−1) (2l)  [Equation 31]

Equation 31(1) indicates that cross-correlation value of the sequences C₁ and C₂ at the delay point of ‘0’ is the same as the auto-correlation value of the sequence C₁ at the delay point of ‘l+1’ and has opposite polarity. Equation 31(1) also indicates that the cross-correlation value of the sequences C₁ and C₂ at the delay point of ‘0’ is the same as half of the auto-correlation value of the code A at the delay point of ‘1’. This is also true for equation 31(2).

Such a rule generates results of the following equations 32 and 33.

2R _(C1)(j)=2R _(C2)(j)=R _(A)(2j+1), where, j is integer  [Equation 32]

R _(C1)(j)=R _(C2)(j)=−R _(C1)(j+l+1)  [Equation 33]

In the above definition, sequences C₂ is defined by equation 1. Therefore, the results of the following equation 34 are generated.

R _(A)(2j)=2R _(C1)(j)

R _(A)(2j+1)=−2R _(C1)(j+l+1)  [Equation 34]

Based on the above description, if the sequence code having double slot length for frame synchronization is N=4l+2(l=2,4,6, . . . ), there exists a pilot sequence C₁ of 2l+1 length having auto-correlation characteristic of equation 24. Otherwise, if the sequence code having double slot length for frame synchronization is N=4l+2(l=1,3,5, . . . ), there exists a pilot sequence C₁ of 2l+1 length having auto-correlation characteristic of the equation 25. As a result, there exists a sequence code A which is N=4l+2(l=1,2,3,4,5, . . . ) and has auto-correlation characteristic of the equation 26 or 27 by equation 34.

Such a result can also be verified in the reverse. If there exists a code A having auto-correlation characteristic of the equation 26 or 27, there results in R_(C1)(j)=1/2R_(A)(2j) by “R_(A)(2j)=1/2R_(C1)(j)” of the equation 34. Accordingly, there essentially exists at least one pilot sequence having auto-correlation characteristic of the equations 24 and 25.

Examples of the pilot sequences of N=4l+2(l=1,2,3,4,5, . . . ) will be described based on the aforementioned description.

The code A having auto-correlation characteristic of the equation 26 or 27 is searched.

First, when l=1 (N=6), there exists a code A as shown in the table 10.

TABLE 10 code A 1 0 0 0 1 1 auto-correlation value of code A 6 2 -2 -6 -2 2 C₁ 1 0 1 auto-correlation value of C₁ 3 -1 -1 C₂ 0 0 1 auto-correlation value of C₂ 3 -1 -1

In table 10, it is noted that there exists one code A when l=1 (N=6).

Second, when l=2 (N=10), there exists a code A, as shown in table 11.

TABLE 11 code A 0 1 0 0 0 1 0 1 1 1 auto-correlation value of code A 10 -2 2 -2 2 -10 2 -2 2 -2 C₁ 0 0 0 0 1 auto-correlation value of C₁ 5 1 1 1 1 C₂ 1 0 1 1 1 auto-correlation value of C₂ 5 1 1 1 1

In table 11, it is noted that there exists one code A when l=2 (N=10).

Third, when l=3 (N=14), there exists a code A as shown in tables 12 and 13.

TABLE 12 code A 0 0 1 0 0 0 0 1 1 0 1 1 1 1 auto-correlation value of code A 14 2-2 2-2 2-2-14-2 2-2 2-2 2 C₁ 0 1 0 0 1 1 1 auto-correlation value of C₁ 7 -1 -1 -1 -1 -1 -1 C₂ 0 0 0 1 0 1 1 auto-correlation value of C₂ 7 -1 -1 -1 -1 -1 -1

TABLE 13 code A 0 1 1 0 0 0 0 1 0 0 1 1 1 1 auto-correlation value of code A 14 2-2 2-2 2-2-14-2 2-2 2-2 2 C₁ 0 1 0 0 0 1 1 auto-correlation value of C₁ 7 -1 -1 -1 -1 -1 -1 C₂ 1 0 0 1 0 1 1 auto-correlation value of C₂ 7 -1 -1 -1 -1 -1 -1

In tables 12 and 13, it is noted that there exists two codes A when l=3 (N=14).

However, there exists no code A corresponding to the equation 26 or 27 when l=4 (N=18).

Fourth, when l=5 (N=22), there exists a code A, as shown in tables 14 and 15.

TABLE 14 code A 0 0 0 1 0 0 1 0 0 0 0 1 1 1 0 1 1 0 1 1 1 1 auto-correlation 22 2-2 2-2 2-2 2-2 2-2-22 -2 2-2 2-2 2-2 2-2 2 value of code A C₁ 0 0 0 1 0 0 1 0 1 1 1 auto-correlation 11 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₁ C₂ 0 1 0 0 0 1 1 1 0 1 1 auto-correlation 11 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₂

TABLE 15 code A 0 1 1 0 1 1 1 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 auto-correlation 22 2-2 2-2 2-2 2-2 2-2-22 -2 2-2 2-2 2-2 2-2 2 value of code A C₁ 0 1 1 1 0 0 0 1 0 1 1 auto-correlation 11 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₁ C₂ 1 0 1 0 0 1 0 0 0 1 1 auto-correlation 11 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₂

In tables 14 and 15, it is noted that there exists two codes A when l=5 (N=22).

Fifth, when l=6 (N=26), there exists the code A as shown in tables 16, 17, 18 and 19.

TABLE 16 code A 0 0 1 1 0 1 0 1 0 0 0 0 0 1 1 0 0 1 0 1 0 1 1 1 1 1 auto-correlation 26 -2 2-2 2-2 2-2 2-2 2-2 2-26 2-2 2-2 2-2 2-2 value of code A 2-2 2-2 C₁ 0 1 0 0 0 0 0 1 0 0 0 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₁ C₂ 0 1 1 1 0 0 1 0 1 1 1 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₂

TABLE 17 code A 0 1 0 1 0 0 1 1 0 0 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 1 auto-correlation 26 -2 2-2 2-2 2-2 2-2 2-2 2-26 2-2 2-2 2-2 2-2 value of code A 2-2 2-2 C₁ 0 0 0 1 0 0 0 0 0 1 0 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₁ C₂ 1 1 0 1 0 0 1 1 1 0 1 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₂

TABLE 18 code A 0 0 1 0 0 0 1 0 1 0 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 1 auto-correlation 26 -2 2-2 2-2 2-2 2-2 2-2 2-26 2-2 2-2 2-2 2-2 value of code A 2-2 2-2 C₁ 0 1 0 1 1 0 0 1 1 1 1 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₁ C₂ 0 0 0 0 0 0 1 0 1 0 0 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₂

TABLE 19 code A 0 1 0 1 1 1 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 1 1 1 1 auto-correlation 26 -2 2-2 2-2 2-2 2-2 2-2 2-26 2-2 2-2 2-2 2-2 value of code A 2-2 2-2 C₁ 0 0 1 0 1 0 0 0 0 0 0 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₁ C₂ 1 1 1 1 0 0 1 1 0 1 0 1 1 auto-correlation 13 1 1 1 1 1 1 1 1 1 1 1 1 value of C₂

In tables 16, 17, 18, and 19, it is noted that there exists four codes A when l=6 (N=26).

Sixth, when l=7 (N=30), there exists a code A, as shown in tables 20 and 21.

TABLE 20 code A 0 0 1 1 1 0 1 1 0 1 0 0 0 0 0 1 1 0 0 0 1 0 0 1 0 1 1 1 1 1 auto-correlation 30 2-2 2-2 2-2 2-2 2-2 2-2 2-2 -30 -2 2-2 2-2 2-2 value of code A 2-2 2-2 2-2 2 C₁ 0 1 1 1 0 0 0 0 1 0 1 0 0 1 1 auto-correlation 15 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₁ C₂ 0 1 0 1 1 0 0 1 0 0 0 1 1 1 1 auto-correlation 15 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₂

TABLE 21 code A 0 1 0 0 1 0 0 0 1 1 0 0 0 0 0 1 0 1 1 0 1 1 1 0 0 1 1 1 1 1 auto-correlation 30 2-2 2-2 2-2 2-2 2-2 2-2 2-2 -30 -2 2-2 2-2 2-2 value of code A 2-2 2-2 2-2 2 C₁ 0 0 1 0 1 0 0 0 0 1 1 1 0 1 1 auto-correlation 15 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₁ C₂ 1 0 0 0 1 0 0 1 1 0 1 0 1 1 1 auto-correlation 15 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 value of C₂

In tables 19 and 20 it is noted that there exists two codes A when l=7 (N=30). However, there exists no code A corresponding to the equation 26 or 27 when l=8 (N=34) in the same manner when l=4 (N=18).

There exists two codes A corresponding to equation 26 or 27 when l=9 (N=38) while there exists no code A corresponding to the equation 26 or 27 when l=10 (N=42) and l=11 (N=46).

Meanwhile, in the case that the dedicated channel of the up or down link uses chip rate of 3.84 Mcps, the code having double length (30 slot length) is used to generate pilot pattern having 15 slot length, shown in the table 22 or table 23. In table 22, the pilot sequence shown in table 20 is inverted and the auto-correlation characteristic, shown in equation 27, is the same. In other words, FC₁ of table 22 is obtained by inverting C₁ of table 20, and FC₂ thereof is obtained by inverting C₂ of table 20.

Respective sequences of FC₁ and FC₂ indicate auto-correlation characteristic of the following equation 35 by equation 25. $\begin{matrix} {{{R_{FC1}(\tau)} = {{R_{FC2}(\tau)} = {\begin{pmatrix} {15,} & {\tau = 0} \\ {{- 1},} & {\tau \neq 0} \end{pmatrix}\quad {where}}}},{l = 7}} & \left\lbrack {{Equation}\quad 35} \right\rbrack \end{matrix}$

The sequence code having 30 slot length of table 23 has auto-correlation characteristic of the following equation 36 by equation 27. $\begin{matrix} {{R_{A =}(\tau)} = {{{\begin{pmatrix} {30,} & {\tau = 0} & \quad \\ {{- 30},} & {\tau = 15} & \quad \\ {2,} & {{\tau = {odd}},} & {\tau \neq 15} \\ {{- 2},} & {{\tau = {even}},} & {\tau \neq 0} \end{pmatrix}\quad {where}},{l = 7}}}} & \left\lbrack {{Equation}\quad 36} \right\rbrack \end{matrix}$

One of the main characteristics of the pilot patterns lies in that auto-correlation results have the same values in case of following four cases: 1) when one sequence is cyclically shifted; 2) when one sequence is temporally converted and is again cyclically shifted; 3) when one sequence is complementary-converted and is again cyclically shifted; and 4) when one sequence is temporally complementary-converted and is again cyclically shifted.

TABLE 22 code sequence (15 slot length) FC₁ = (1 0 0 0 1 1 1 1 0 1 0 1 1 0 0) FC₂ = (1 0 1 0 0 1 1 0 1 1 1 0 0 0 0)

TABLE 23 30 slot length sequence A′ = (110001001011111001110110100000)

The code sequence of 30 slot length having optimal auto-correlation characteristic is applied to correlation process for frame synchronization for an up link physical channel (Uplink DPCH), a down link physical channel (Downlink DPCH), and a common control physical channel (CCPCH).

As an example, the code sequence of 15 slot length may be generated using PN code generators 100 and 200 shown in FIG. 29. The PN code generators 100 and 200 properly use initial values of each shift register to generate the pilot patterns of the present invention.

The PN code generators 100 and 200 generate PN codes using polynomials for generating PN codes, such as equations 37 and 38.

X(x)=x ^(4+x) ³+1  [Equation 37]

Y(x)=x ^(4+x)+1  [Equation 38]

The code sequences output from the PN code generator 100 by the initial value X(x) shown in equation 37 and FIG. 29 are FC₁ and FC₂ of table 22. The outputs FC₁ and FC₁ of 30 slot is a code A′ of table 23. The code sequences output from the PN code generator 200 by the initial value Y(x) shown in equation 38 and FIG. 29 are FC₃ and FC₄ of table 24. The outputs FC₃ and FC₄ of 30 slot length is the code B′ of table 25.

TABLE 24 Code sequence (15 slot length) FC3 = (1 1 0 0 0 1 0 0 1 1 0 1 0 1 1) FC4 = (0 0 1 0 1 0 0 0 0 1 1 1 0 1 1)

TABLE 25 30 slot length sequence B′ = (101001000110000010110111001111)

The procedures for generating FC₁, FC₂, FC₃ and FC₄ from the PN code generators of FIG. 29 will be described below. The polynomial of equation 37, i.e., X(x)=x⁴+x³+1, is used for the PN code generator 100. Equation 37 can be expressed again by equation 39.

 X(x)=g ₀ x ⁴ +g ₁ x ³ +g ₂ x ² +g ₃ x+g ₄  [Equation 39]

By comparing equation 38 with equation 39, the results can be obtained, such as g₀=1, g₁=1, g₂=0, g₃=0, g₄=1. Hence, the PN code generator 100 determines an output value for exclusive OR from outputs of respective shift registers 111-114 and 121-124 of the first code generator 110 and the second code generator 120.

Since the respective shift registers 111, 112, 113 and 114 of the first code generator 110 have the initial values as “0 0 0 1”, the first shift register 111 initially outputs “1”. Thereafter, the first shift register 111, the second shift register 112, and the third shift register 113, respectively, store “0 0 0” in turn. The fourth shift register 114 stores exclusive OR value “1” for its output “0” and the output “1” of the first shift register 111. Accordingly, the respective registers 111, 112, 113 and 114 of the first code generator 110 store “1 0 0 0”.

Afterwards, the first shift register 111 outputs “0” again. Then, the first shift register 111 stores “0” stored in the second shift register 112, and the second shift register 112 stores “0” stored in the third shift register 113. Also, the third shift register 113 stores “1” stored in the fourth shift register 114. At this time, the fourth shift register 114 stores exclusive OR value “1” for its output “1” and the output “0” of the first shift register 111. The first code generator 110 repeats the above operation.

Furthermore, the polynomial of equation 38, i.e., Y(x)=x⁴+x+1, is used for the PN code generator 200. Equation 38 can be expressed again by equation 40.

Y(x)=h ₀ x ⁴ +h ₁ x ³ +h ₂ x ² +h ₃ x+h ₄  [Equation 40]

By comparing equation 38 with equation 40, the results can be obtained, such as h₀=1, h₁=0, h₂=0, h₃=1, h₄=1. As a result, the PN code generator 200 determines an output value for exclusive OR from outputs of respective shift registers of the third code generator 210 and the fourth code generator 220.

In the same manner as the code generating operation of the first code generator 110, the second code generator 120, the third code generator 210, and the fourth code generator 220 repeat the above code generating operation. However, the second code generator 120 and the fourth code generator 220 inverts the binary sign. Since the respective code generators 110, 120, 210 and 220 have different initial values and different code generating polynomials, they output different code rows.

The following table 26 shows the outputs of the respective code generators 110, 120, 210 and 220.

TABLE 26 First code Second code third code fourth code Generator generator generator generator Output Output output Output of #0 of #0 of #0 of #0 shift register #3 #2 #1 (FC₁) #3 #2 #1 (FC₂) #3 #2 #1 (FC₃) #3 #2 #1 (FC₄) initial value → 0 0 0 1 1 0 1 0 0 0 1 1 1 0 1 1 Shift#1 1 0 0 0 1 1 0 1 1 0 0 1 0 1 0 1 Shift#2 1 1 0 0 0 1 1 0 0 1 0 0 1 0 1 0 shift#3 1 1 1 0 0 0 1 1 0 0 1 0 1 1 0 1 shift#4 1 1 1 1 1 0 0 1 0 0 0 1 0 1 1 0 shift#5 0 1 1 1 0 1 0 0 1 0 0 0 0 0 1 1 shift#6 1 0 1 1 0 0 1 0 1 1 0 0 1 0 0 1 shift#7 0 1 0 1 0 0 0 1 1 1 1 0 0 1 0 0 shift#8 1 0 1 0 1 0 0 0 1 1 1 1 0 0 1 0 shift#9 1 1 0 1 1 1 0 0 0 1 1 1 0 0 0 1 shift#10 0 1 1 0 1 1 1 0 1 0 1 1 1 0 0 0 shift#11 0 0 1 1 1 1 1 1 0 1 0 1 1 1 0 0 shift#12 1 0 0 1 0 1 1 1 1 0 1 0 1 1 1 0 shift#13 0 1 0 0 1 0 1 1 1 1 0 1 1 1 1 1 shift#14 0 0 1 0 0 1 0 1 0 1 1 0 0 1 1 1 shift#15 0 0 0 1 1 0 1 0 0 0 1 1 1 0 1 1

In the above table 26, the code A′ is generated from FC₁ and FC₂ and the code B′ is generated from FC₃ and FC₄. Further, as shown from table 26, the first code generator 110 and the second code generator 120 perform exclusive OR for the output of the shift register #3 and the output of the shift register #0 and then determine a binary value of the shift register #3 of the next shift#.

However, since the third code generator 210 and the fourth code generator 220 use different PN code generating polynomials, they perform exclusive OR for the output of the shift register #1 and the output of the shift register #0 and then determine a binary value of the shift register #3 of the next shift#.

The method of generating pilot sequences for frame synchronization has various advantages. When the up link and the down link of the mobile communication system use chip rate of 3.84 Mcps, it is possible to generate optimal pilot patterns having double length of slots for frame synchronization by means of mathematical demonstration and verification. As a result, the pilot sequence of 30 slot length can easily be generated by the PN code generator for generating PN code of 2^(n)−1 length. Furthermore, in case that the pilot pattern generated by the mathematical demonstration and verification is applied to frame synchronization, optimal performance can be supported, thereby remarkably improving performance of the next generation mobile communication system.

The foregoing embodiments are merely exemplary and are not to be construed as limiting the present invention. The present teaching can be readily applied to other types of apparatuses. The description of the present invention is intended to be illustrative, and not to limit the scope of the claims. Many alternatives, modifications, and variations will be apparent to those skilled in the art. In the claims, means-plus-function clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents but also equivalent structures. 

What is claimed is:
 1. A method of generating pilot sequences for frame synchronization comprising: selecting a bit length of pilot sequences used for frame synchronization; selecting a first code sequence having a maximum autocorrelation value at a specific delay point of a correlation period and having a minimum autocorrelation value at the other delay points excluding the specific delay point; selecting a second code sequence having the same autocorrelation characteristic as the first code sequence, wherein the first and second code sequences have maximum autocorrelation values at the same specific delay points; and combining the selected code sequences to generate pilot sequences having the selected bit length and having a distinct autocorrelation values at a specific time shift, wherein the second code sequence is determined by shifting the first code sequence by a certain bit length and by inverting the shifted first code sequence.
 2. A method of generating pilot sequences for frame synchronization comprising: selecting a bit length of pilot sequences used for frame synchronization; selecting a first code sequence having a maximum autocorrelation value at a specific delay point of a correlation period and having a minimum autocorrelation value at the other delay points excluding the specific delay point; selecting a second code sequence having the same autocorrelation characteristic as the first code sequence, wherein the first and second code sequences have maximum autocorrelation values at the same specific delay points; and combining the selected code sequences to generate pilot sequences having the selected bit length and having a distinct autocorrelation values at a specific time shift, wherein the pilot sequences have maximum autocorrelation values corresponding to their bit lengths at a matched delay point of the correlation period and have minimum autocorrelation values at the other delay points excluding the matched delay point and having absolute value inversely proportional of the bit length to the maximum correlation values.
 3. The method of generating pilot sequences for frame synchronization of claim 1 or 2, wherein the first code sequence and the second code sequence are transmitted through STTD encoder as a pair forming a complex number.
 4. The method of generating pilot sequences for frame synchronization of claim 1 or 2, wherein the first code sequence and the second code sequence are generated by PN code generators which can be used for generating PN codes for code division multiplexing.
 5. The method of generating pilot sequences for frame synchronization of claim 4, wherein the first code sequence and the second code sequence are generated by PN code generators using the same PN code generating polynomials.
 6. A method of generating a pilot sequence for estimating synchronization of a radio frame of a communication system comprising: selecting a first code sequence having a significant autocorrelation value at a matched point of a correlation period and having an insignificant autocorrelation value at the other points excluding the matched point; selecting a second code sequence having the same autocorrelation characteristic as the first selected code sequence, wherein the first and second code sequences have a significant cross-correlation values having polarity opposite to said significant autocorrelation value at a specific delay point; and combining the selected code sequences to generate a pilot sequence, wherein the second sequence is made by shifting the first code sequence by a certain bit length and by inverting the shifted first code sequence.
 7. A method of generating a pilot sequence for estimating synchronization of a radio frame of a communication system comprising: selecting a first code sequence having a significant autocorrelation value at a matched point of a correlation period and having an insignificant autocorrelation value at the other points excluding the matched point; selecting a second code sequence having the same autocorrelation characteristic as the first selected code sequence, wherein the first and second code sequences have a significant cross-correlation values having polarity opposite to said significant autocorrelation value at a specific delay point; and combining the selected code sequences to generate a pilot sequence, wherein the pilot sequence have maximum autocorrelation values corresponding to their length at a matched point of the correlation period and have minimum autocorrelation value having polarity opposite to said maximum autocorrelation value near the half length delay point hand have insignificant autocorrelation values at the other points excluding the matched and near half length delay points.
 8. The method of generating a pilot sequence for estimating synchronization of a radio frame of a communication system of claim 6 or 7, wherein the first code sequence and the second code sequence are transmitted through STTD encoder as a pair forming a complex number.
 9. The method of generating a pilot sequence for estimating synchronization of a radio frame of a communication system of claim 6 or 7, wherein the first code sequence and the second code sequence are generated by PN code generators which can be used for generating PN codes for code division multiplexing.
 10. The method of generating a pilot sequence for estimating synchronization of a radio frame of a communication system of claim 9, wherein the first code sequence and the second code sequence are generated by PN code generators which use the same PN code generating polynomials. 